./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ead4d47009bf2f1ade65f6eacfdab211d65347e20b879f4822b8ceaab9ef42cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:08:11,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:08:11,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:08:11,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:08:11,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:08:11,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:08:11,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:08:11,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:08:11,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:08:11,879 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:08:11,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:08:11,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:08:11,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:08:11,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:08:11,879 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:08:11,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:08:11,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:08:11,879 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:08:11,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:08:11,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:08:11,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:08:11,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:08:11,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:08:11,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:08:11,880 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:08:11,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:08:11,880 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:08:11,880 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:08:11,880 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:08:11,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:08:11,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:08:11,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:08:11,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:08:11,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:08:11,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:08:11,880 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:08:11,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:08:11,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:08:11,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:08:11,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:08:11,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:08:11,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:08:11,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:08:11,881 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ead4d47009bf2f1ade65f6eacfdab211d65347e20b879f4822b8ceaab9ef42cd [2025-03-16 20:08:12,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:08:12,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:08:12,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:08:12,104 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:08:12,104 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:08:12,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-2.c [2025-03-16 20:08:13,249 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6639867/54ce88b93ceb4769992fe4355a6491f8/FLAG740207d76 [2025-03-16 20:08:13,835 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:08:13,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-2.c [2025-03-16 20:08:13,883 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6639867/54ce88b93ceb4769992fe4355a6491f8/FLAG740207d76 [2025-03-16 20:08:13,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6639867/54ce88b93ceb4769992fe4355a6491f8 [2025-03-16 20:08:13,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:08:13,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:08:13,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:08:13,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:08:13,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:08:13,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:08:13" (1/1) ... [2025-03-16 20:08:13,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@266425e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:13, skipping insertion in model container [2025-03-16 20:08:13,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:08:13" (1/1) ... [2025-03-16 20:08:14,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:08:15,058 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-2.c[380593,380606] [2025-03-16 20:08:15,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-2.c[383339,383352] [2025-03-16 20:08:15,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:08:15,299 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:08:15,771 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-2.c[380593,380606] [2025-03-16 20:08:15,775 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-2.c[383339,383352] [2025-03-16 20:08:15,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:08:15,839 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:08:15,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:15 WrapperNode [2025-03-16 20:08:15,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:08:15,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:08:15,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:08:15,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:08:15,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:15" (1/1) ... [2025-03-16 20:08:15,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:15" (1/1) ... [2025-03-16 20:08:16,165 INFO L138 Inliner]: procedures = 64, calls = 71, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 13071 [2025-03-16 20:08:16,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:08:16,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:08:16,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:08:16,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:08:16,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:15" (1/1) ... [2025-03-16 20:08:16,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:15" (1/1) ... [2025-03-16 20:08:16,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:15" (1/1) ... [2025-03-16 20:08:16,304 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:08:16,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:15" (1/1) ... [2025-03-16 20:08:16,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:15" (1/1) ... [2025-03-16 20:08:16,560 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:15" (1/1) ... [2025-03-16 20:08:16,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:15" (1/1) ... [2025-03-16 20:08:16,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:15" (1/1) ... [2025-03-16 20:08:16,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:15" (1/1) ... [2025-03-16 20:08:16,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:08:16,663 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:08:16,664 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:08:16,664 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:08:16,664 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:15" (1/1) ... [2025-03-16 20:08:16,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:08:16,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:08:16,691 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:08:16,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:08:16,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:08:16,714 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 20:08:16,714 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 20:08:16,714 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 20:08:16,714 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 20:08:16,714 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 20:08:16,715 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 20:08:16,715 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 20:08:16,715 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 20:08:16,715 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 20:08:16,715 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 20:08:16,715 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 20:08:16,715 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 20:08:16,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:08:16,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:08:16,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:08:16,818 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:08:16,820 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:08:22,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 20:08:22,620 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 20:08:22,620 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 20:08:22,620 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 20:08:22,621 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 20:08:22,621 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 20:08:22,621 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 20:08:22,907 INFO L? ?]: Removed 1730 outVars from TransFormulas that were not future-live. [2025-03-16 20:08:22,907 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:08:22,961 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:08:22,965 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:08:22,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:08:22 BoogieIcfgContainer [2025-03-16 20:08:22,965 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:08:22,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:08:22,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:08:22,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:08:22,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:08:13" (1/3) ... [2025-03-16 20:08:22,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d484af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:08:22, skipping insertion in model container [2025-03-16 20:08:22,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:15" (2/3) ... [2025-03-16 20:08:22,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d484af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:08:22, skipping insertion in model container [2025-03-16 20:08:22,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:08:22" (3/3) ... [2025-03-16 20:08:22,972 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.10.cil-2.c [2025-03-16 20:08:22,982 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:08:22,985 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.10.cil-2.c that has 7 procedures, 2436 locations, 1 initial locations, 14 loop locations, and 2 error locations. [2025-03-16 20:08:23,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:08:23,089 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@625c9d1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:08:23,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:08:23,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 2436 states, 2404 states have (on average 1.8668885191347753) internal successors, (4488), 2406 states have internal predecessors, (4488), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 20:08:23,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:08:23,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:23,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:23,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:23,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:23,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1422575049, now seen corresponding path program 1 times [2025-03-16 20:08:23,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:23,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437054676] [2025-03-16 20:08:23,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:23,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:23,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:08:23,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:08:23,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:23,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:23,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:23,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437054676] [2025-03-16 20:08:23,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437054676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:23,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:23,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:08:23,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616118633] [2025-03-16 20:08:23,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:23,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:08:23,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:23,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:08:23,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:08:23,465 INFO L87 Difference]: Start difference. First operand has 2436 states, 2404 states have (on average 1.8668885191347753) internal successors, (4488), 2406 states have internal predecessors, (4488), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:23,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:23,659 INFO L93 Difference]: Finished difference Result 4869 states and 9064 transitions. [2025-03-16 20:08:23,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:08:23,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:08:23,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:23,689 INFO L225 Difference]: With dead ends: 4869 [2025-03-16 20:08:23,690 INFO L226 Difference]: Without dead ends: 2431 [2025-03-16 20:08:23,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:08:23,699 INFO L435 NwaCegarLoop]: 4460 mSDtfsCounter, 495 mSDsluCounter, 3961 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 8421 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:23,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 8421 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:08:23,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2025-03-16 20:08:23,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 2431. [2025-03-16 20:08:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 2399 states have (on average 1.8361817423926636) internal successors, (4405), 2401 states have internal predecessors, (4405), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 20:08:23,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 4453 transitions. [2025-03-16 20:08:23,795 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 4453 transitions. Word has length 141 [2025-03-16 20:08:23,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:23,796 INFO L471 AbstractCegarLoop]: Abstraction has 2431 states and 4453 transitions. [2025-03-16 20:08:23,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:23,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 4453 transitions. [2025-03-16 20:08:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:08:23,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:23,800 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:23,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:08:23,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:23,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:23,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1533628824, now seen corresponding path program 1 times [2025-03-16 20:08:23,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:23,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16726698] [2025-03-16 20:08:23,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:23,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:23,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:08:23,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:08:23,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:23,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:23,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:23,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16726698] [2025-03-16 20:08:23,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16726698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:23,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:23,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:08:23,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350882350] [2025-03-16 20:08:23,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:23,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:08:23,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:23,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:08:23,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:08:23,966 INFO L87 Difference]: Start difference. First operand 2431 states and 4453 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:24,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:24,030 INFO L93 Difference]: Finished difference Result 2728 states and 4925 transitions. [2025-03-16 20:08:24,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:08:24,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:08:24,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:24,043 INFO L225 Difference]: With dead ends: 2728 [2025-03-16 20:08:24,043 INFO L226 Difference]: Without dead ends: 2431 [2025-03-16 20:08:24,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:08:24,046 INFO L435 NwaCegarLoop]: 4451 mSDtfsCounter, 482 mSDsluCounter, 3957 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 8408 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:24,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 8408 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:08:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2025-03-16 20:08:24,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 2431. [2025-03-16 20:08:24,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 2399 states have (on average 1.8357649020425177) internal successors, (4404), 2401 states have internal predecessors, (4404), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 20:08:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 4452 transitions. [2025-03-16 20:08:24,114 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 4452 transitions. Word has length 141 [2025-03-16 20:08:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:24,115 INFO L471 AbstractCegarLoop]: Abstraction has 2431 states and 4452 transitions. [2025-03-16 20:08:24,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:24,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 4452 transitions. [2025-03-16 20:08:24,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:08:24,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:24,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:24,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:08:24,120 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:24,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:24,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1748457977, now seen corresponding path program 1 times [2025-03-16 20:08:24,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:24,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160710012] [2025-03-16 20:08:24,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:24,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:24,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:08:24,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:08:24,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:24,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:24,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:24,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:24,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160710012] [2025-03-16 20:08:24,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160710012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:24,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:24,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:24,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142929373] [2025-03-16 20:08:24,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:24,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:24,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:24,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:24,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:24,281 INFO L87 Difference]: Start difference. First operand 2431 states and 4452 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:24,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:24,840 INFO L93 Difference]: Finished difference Result 3060 states and 5469 transitions. [2025-03-16 20:08:24,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:08:24,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:08:24,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:24,853 INFO L225 Difference]: With dead ends: 3060 [2025-03-16 20:08:24,854 INFO L226 Difference]: Without dead ends: 2766 [2025-03-16 20:08:24,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:24,858 INFO L435 NwaCegarLoop]: 4347 mSDtfsCounter, 4901 mSDsluCounter, 8906 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4919 SdHoareTripleChecker+Valid, 13253 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:24,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4919 Valid, 13253 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:08:24,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2766 states. [2025-03-16 20:08:24,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2766 to 2741. [2025-03-16 20:08:24,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2741 states, 2683 states have (on average 1.8128960119269475) internal successors, (4864), 2686 states have internal predecessors, (4864), 43 states have call successors, (43), 12 states have call predecessors, (43), 13 states have return successors, (44), 43 states have call predecessors, (44), 43 states have call successors, (44) [2025-03-16 20:08:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 4951 transitions. [2025-03-16 20:08:24,927 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 4951 transitions. Word has length 141 [2025-03-16 20:08:24,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:24,928 INFO L471 AbstractCegarLoop]: Abstraction has 2741 states and 4951 transitions. [2025-03-16 20:08:24,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:24,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 4951 transitions. [2025-03-16 20:08:24,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:08:24,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:24,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:24,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:08:24,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:24,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:24,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1424230120, now seen corresponding path program 1 times [2025-03-16 20:08:24,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:24,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139575068] [2025-03-16 20:08:24,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:24,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:24,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:08:24,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:08:24,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:24,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:25,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:25,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139575068] [2025-03-16 20:08:25,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139575068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:25,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:25,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:25,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796308071] [2025-03-16 20:08:25,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:25,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:25,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:25,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:25,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:25,109 INFO L87 Difference]: Start difference. First operand 2741 states and 4951 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:25,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:25,431 INFO L93 Difference]: Finished difference Result 3411 states and 6047 transitions. [2025-03-16 20:08:25,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:25,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:08:25,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:25,443 INFO L225 Difference]: With dead ends: 3411 [2025-03-16 20:08:25,444 INFO L226 Difference]: Without dead ends: 2807 [2025-03-16 20:08:25,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:25,449 INFO L435 NwaCegarLoop]: 4337 mSDtfsCounter, 4625 mSDsluCounter, 8539 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4643 SdHoareTripleChecker+Valid, 12876 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:25,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4643 Valid, 12876 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:08:25,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2025-03-16 20:08:25,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2741. [2025-03-16 20:08:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2741 states, 2683 states have (on average 1.812150577711517) internal successors, (4862), 2686 states have internal predecessors, (4862), 43 states have call successors, (43), 12 states have call predecessors, (43), 13 states have return successors, (44), 43 states have call predecessors, (44), 43 states have call successors, (44) [2025-03-16 20:08:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 4949 transitions. [2025-03-16 20:08:25,519 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 4949 transitions. Word has length 141 [2025-03-16 20:08:25,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:25,519 INFO L471 AbstractCegarLoop]: Abstraction has 2741 states and 4949 transitions. [2025-03-16 20:08:25,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:25,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 4949 transitions. [2025-03-16 20:08:25,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:08:25,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:25,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:25,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:08:25,521 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:25,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:25,521 INFO L85 PathProgramCache]: Analyzing trace with hash 967277081, now seen corresponding path program 1 times [2025-03-16 20:08:25,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:25,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168148846] [2025-03-16 20:08:25,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:25,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:25,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:08:25,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:08:25,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:25,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:25,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:25,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:25,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168148846] [2025-03-16 20:08:25,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168148846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:25,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:25,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:25,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224880036] [2025-03-16 20:08:25,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:25,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:25,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:25,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:25,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:25,790 INFO L87 Difference]: Start difference. First operand 2741 states and 4949 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:26,428 INFO L93 Difference]: Finished difference Result 3740 states and 6572 transitions. [2025-03-16 20:08:26,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:26,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:08:26,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:26,444 INFO L225 Difference]: With dead ends: 3740 [2025-03-16 20:08:26,444 INFO L226 Difference]: Without dead ends: 3136 [2025-03-16 20:08:26,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:26,449 INFO L435 NwaCegarLoop]: 4611 mSDtfsCounter, 4899 mSDsluCounter, 13868 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4917 SdHoareTripleChecker+Valid, 18479 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:26,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4917 Valid, 18479 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:08:26,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2025-03-16 20:08:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 3027. [2025-03-16 20:08:26,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3027 states, 2943 states have (on average 1.7917091403329934) internal successors, (5273), 2947 states have internal predecessors, (5273), 62 states have call successors, (62), 18 states have call predecessors, (62), 20 states have return successors, (66), 63 states have call predecessors, (66), 62 states have call successors, (66) [2025-03-16 20:08:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3027 states to 3027 states and 5401 transitions. [2025-03-16 20:08:26,525 INFO L78 Accepts]: Start accepts. Automaton has 3027 states and 5401 transitions. Word has length 141 [2025-03-16 20:08:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:26,525 INFO L471 AbstractCegarLoop]: Abstraction has 3027 states and 5401 transitions. [2025-03-16 20:08:26,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3027 states and 5401 transitions. [2025-03-16 20:08:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:08:26,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:26,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:26,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:08:26,527 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:26,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:26,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1726524168, now seen corresponding path program 1 times [2025-03-16 20:08:26,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:26,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192487287] [2025-03-16 20:08:26,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:26,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:26,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:08:26,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:08:26,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:26,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:26,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:26,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192487287] [2025-03-16 20:08:26,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192487287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:26,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:26,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:26,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374614207] [2025-03-16 20:08:26,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:26,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:26,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:26,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:26,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:26,662 INFO L87 Difference]: Start difference. First operand 3027 states and 5401 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:27,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:27,295 INFO L93 Difference]: Finished difference Result 4653 states and 8037 transitions. [2025-03-16 20:08:27,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:27,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:08:27,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:27,310 INFO L225 Difference]: With dead ends: 4653 [2025-03-16 20:08:27,310 INFO L226 Difference]: Without dead ends: 3763 [2025-03-16 20:08:27,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:27,315 INFO L435 NwaCegarLoop]: 4607 mSDtfsCounter, 4894 mSDsluCounter, 13856 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4912 SdHoareTripleChecker+Valid, 18463 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:27,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4912 Valid, 18463 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:08:27,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3763 states. [2025-03-16 20:08:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3763 to 3638. [2025-03-16 20:08:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3638 states, 3500 states have (on average 1.7617142857142858) internal successors, (6166), 3508 states have internal predecessors, (6166), 100 states have call successors, (100), 30 states have call predecessors, (100), 36 states have return successors, (116), 103 states have call predecessors, (116), 100 states have call successors, (116) [2025-03-16 20:08:27,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3638 states to 3638 states and 6382 transitions. [2025-03-16 20:08:27,416 INFO L78 Accepts]: Start accepts. Automaton has 3638 states and 6382 transitions. Word has length 141 [2025-03-16 20:08:27,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:27,416 INFO L471 AbstractCegarLoop]: Abstraction has 3638 states and 6382 transitions. [2025-03-16 20:08:27,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:27,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3638 states and 6382 transitions. [2025-03-16 20:08:27,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:08:27,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:27,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:27,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:08:27,419 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:27,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:27,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1927356985, now seen corresponding path program 1 times [2025-03-16 20:08:27,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:27,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049481627] [2025-03-16 20:08:27,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:27,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:27,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:08:27,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:08:27,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:27,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:27,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:27,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049481627] [2025-03-16 20:08:27,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049481627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:27,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:27,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:27,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288051311] [2025-03-16 20:08:27,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:27,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:27,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:27,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:27,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:27,543 INFO L87 Difference]: Start difference. First operand 3638 states and 6382 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:28,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:28,238 INFO L93 Difference]: Finished difference Result 6630 states and 11272 transitions. [2025-03-16 20:08:28,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:28,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:08:28,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:28,257 INFO L225 Difference]: With dead ends: 6630 [2025-03-16 20:08:28,257 INFO L226 Difference]: Without dead ends: 5129 [2025-03-16 20:08:28,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:28,263 INFO L435 NwaCegarLoop]: 4604 mSDtfsCounter, 4889 mSDsluCounter, 13847 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4907 SdHoareTripleChecker+Valid, 18451 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:28,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4907 Valid, 18451 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:08:28,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5129 states. [2025-03-16 20:08:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5129 to 4971. [2025-03-16 20:08:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4971 states, 4719 states have (on average 1.7279084551811825) internal successors, (8154), 4741 states have internal predecessors, (8154), 176 states have call successors, (176), 54 states have call predecessors, (176), 74 states have return successors, (240), 183 states have call predecessors, (240), 176 states have call successors, (240) [2025-03-16 20:08:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4971 states to 4971 states and 8570 transitions. [2025-03-16 20:08:28,461 INFO L78 Accepts]: Start accepts. Automaton has 4971 states and 8570 transitions. Word has length 141 [2025-03-16 20:08:28,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:28,461 INFO L471 AbstractCegarLoop]: Abstraction has 4971 states and 8570 transitions. [2025-03-16 20:08:28,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:28,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4971 states and 8570 transitions. [2025-03-16 20:08:28,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:08:28,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:28,464 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:28,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:08:28,465 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:28,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:28,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1141364520, now seen corresponding path program 1 times [2025-03-16 20:08:28,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:28,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877195036] [2025-03-16 20:08:28,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:28,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:28,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:08:28,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:08:28,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:28,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:28,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:28,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877195036] [2025-03-16 20:08:28,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877195036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:28,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:28,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:28,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790894084] [2025-03-16 20:08:28,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:28,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:28,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:28,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:28,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:28,608 INFO L87 Difference]: Start difference. First operand 4971 states and 8570 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:29,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:29,404 INFO L93 Difference]: Finished difference Result 11009 states and 18634 transitions. [2025-03-16 20:08:29,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:29,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:08:29,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:29,432 INFO L225 Difference]: With dead ends: 11009 [2025-03-16 20:08:29,432 INFO L226 Difference]: Without dead ends: 8175 [2025-03-16 20:08:29,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:29,447 INFO L435 NwaCegarLoop]: 4601 mSDtfsCounter, 4884 mSDsluCounter, 13838 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4902 SdHoareTripleChecker+Valid, 18439 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:29,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4902 Valid, 18439 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:08:29,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8175 states. [2025-03-16 20:08:29,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8175 to 7952. [2025-03-16 20:08:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7952 states, 7454 states have (on average 1.7040515159645828) internal successors, (12702), 7522 states have internal predecessors, (12702), 328 states have call successors, (328), 102 states have call predecessors, (328), 168 states have return successors, (584), 343 states have call predecessors, (584), 328 states have call successors, (584) [2025-03-16 20:08:29,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7952 states to 7952 states and 13614 transitions. [2025-03-16 20:08:29,668 INFO L78 Accepts]: Start accepts. Automaton has 7952 states and 13614 transitions. Word has length 141 [2025-03-16 20:08:29,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:29,668 INFO L471 AbstractCegarLoop]: Abstraction has 7952 states and 13614 transitions. [2025-03-16 20:08:29,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:29,668 INFO L276 IsEmpty]: Start isEmpty. Operand 7952 states and 13614 transitions. [2025-03-16 20:08:29,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:08:29,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:29,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:29,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:08:29,673 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:29,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:29,673 INFO L85 PathProgramCache]: Analyzing trace with hash 145117785, now seen corresponding path program 1 times [2025-03-16 20:08:29,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:29,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781086589] [2025-03-16 20:08:29,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:29,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:29,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:08:29,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:08:29,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:29,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:29,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:29,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:29,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781086589] [2025-03-16 20:08:29,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781086589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:29,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:29,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:29,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091864023] [2025-03-16 20:08:29,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:29,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:29,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:29,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:29,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:29,799 INFO L87 Difference]: Start difference. First operand 7952 states and 13614 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:30,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:30,615 INFO L93 Difference]: Finished difference Result 20968 states and 36012 transitions. [2025-03-16 20:08:30,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:30,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:08:30,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:30,672 INFO L225 Difference]: With dead ends: 20968 [2025-03-16 20:08:30,672 INFO L226 Difference]: Without dead ends: 15153 [2025-03-16 20:08:30,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:30,693 INFO L435 NwaCegarLoop]: 4598 mSDtfsCounter, 4879 mSDsluCounter, 13829 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4897 SdHoareTripleChecker+Valid, 18427 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:30,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4897 Valid, 18427 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:08:30,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15153 states. [2025-03-16 20:08:31,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15153 to 14805. [2025-03-16 20:08:31,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14805 states, 13761 states have (on average 1.7011845069399025) internal successors, (23410), 13975 states have internal predecessors, (23410), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-03-16 20:08:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14805 states to 14805 states and 25698 transitions. [2025-03-16 20:08:31,116 INFO L78 Accepts]: Start accepts. Automaton has 14805 states and 25698 transitions. Word has length 141 [2025-03-16 20:08:31,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:31,117 INFO L471 AbstractCegarLoop]: Abstraction has 14805 states and 25698 transitions. [2025-03-16 20:08:31,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:31,117 INFO L276 IsEmpty]: Start isEmpty. Operand 14805 states and 25698 transitions. [2025-03-16 20:08:31,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:08:31,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:31,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:31,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:08:31,125 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:31,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:31,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2126279864, now seen corresponding path program 1 times [2025-03-16 20:08:31,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:31,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030428384] [2025-03-16 20:08:31,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:31,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:31,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:08:31,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:08:31,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:31,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:31,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:31,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:31,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030428384] [2025-03-16 20:08:31,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030428384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:31,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:31,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:31,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702763073] [2025-03-16 20:08:31,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:31,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:31,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:31,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:31,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:31,231 INFO L87 Difference]: Start difference. First operand 14805 states and 25698 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:31,836 INFO L93 Difference]: Finished difference Result 31393 states and 55608 transitions. [2025-03-16 20:08:31,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:31,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:08:31,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:31,900 INFO L225 Difference]: With dead ends: 31393 [2025-03-16 20:08:31,900 INFO L226 Difference]: Without dead ends: 18725 [2025-03-16 20:08:31,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:31,936 INFO L435 NwaCegarLoop]: 4324 mSDtfsCounter, 4617 mSDsluCounter, 8514 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4635 SdHoareTripleChecker+Valid, 12838 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:31,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4635 Valid, 12838 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:08:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18725 states. [2025-03-16 20:08:32,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18725 to 14805. [2025-03-16 20:08:32,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14805 states, 13761 states have (on average 1.6987864254051304) internal successors, (23377), 13975 states have internal predecessors, (23377), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-03-16 20:08:32,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14805 states to 14805 states and 25665 transitions. [2025-03-16 20:08:32,420 INFO L78 Accepts]: Start accepts. Automaton has 14805 states and 25665 transitions. Word has length 141 [2025-03-16 20:08:32,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:32,420 INFO L471 AbstractCegarLoop]: Abstraction has 14805 states and 25665 transitions. [2025-03-16 20:08:32,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 14805 states and 25665 transitions. [2025-03-16 20:08:32,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:08:32,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:32,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:32,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:08:32,427 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:32,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:32,428 INFO L85 PathProgramCache]: Analyzing trace with hash 943262329, now seen corresponding path program 1 times [2025-03-16 20:08:32,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:32,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447565141] [2025-03-16 20:08:32,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:32,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:32,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:08:32,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:08:32,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:32,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:32,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:32,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447565141] [2025-03-16 20:08:32,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447565141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:32,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:32,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:32,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492423977] [2025-03-16 20:08:32,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:32,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:32,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:32,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:32,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:32,518 INFO L87 Difference]: Start difference. First operand 14805 states and 25665 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:33,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:33,150 INFO L93 Difference]: Finished difference Result 31148 states and 55052 transitions. [2025-03-16 20:08:33,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:33,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:08:33,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:33,213 INFO L225 Difference]: With dead ends: 31148 [2025-03-16 20:08:33,213 INFO L226 Difference]: Without dead ends: 18480 [2025-03-16 20:08:33,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:33,247 INFO L435 NwaCegarLoop]: 4292 mSDtfsCounter, 4641 mSDsluCounter, 8480 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4659 SdHoareTripleChecker+Valid, 12772 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:33,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4659 Valid, 12772 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:08:33,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18480 states. [2025-03-16 20:08:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18480 to 14805. [2025-03-16 20:08:33,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14805 states, 13761 states have (on average 1.6963883438703582) internal successors, (23344), 13975 states have internal predecessors, (23344), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-03-16 20:08:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14805 states to 14805 states and 25632 transitions. [2025-03-16 20:08:33,824 INFO L78 Accepts]: Start accepts. Automaton has 14805 states and 25632 transitions. Word has length 141 [2025-03-16 20:08:33,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:33,825 INFO L471 AbstractCegarLoop]: Abstraction has 14805 states and 25632 transitions. [2025-03-16 20:08:33,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:33,826 INFO L276 IsEmpty]: Start isEmpty. Operand 14805 states and 25632 transitions. [2025-03-16 20:08:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:08:33,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:33,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:33,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:08:33,833 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:33,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:33,834 INFO L85 PathProgramCache]: Analyzing trace with hash -203278184, now seen corresponding path program 1 times [2025-03-16 20:08:33,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:33,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580434640] [2025-03-16 20:08:33,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:33,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:33,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:08:33,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:08:33,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:33,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:33,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:33,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580434640] [2025-03-16 20:08:33,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580434640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:33,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:33,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:33,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060762627] [2025-03-16 20:08:33,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:33,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:33,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:33,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:33,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:33,978 INFO L87 Difference]: Start difference. First operand 14805 states and 25632 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:35,274 INFO L93 Difference]: Finished difference Result 43719 states and 77484 transitions. [2025-03-16 20:08:35,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:35,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:08:35,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:35,470 INFO L225 Difference]: With dead ends: 43719 [2025-03-16 20:08:35,471 INFO L226 Difference]: Without dead ends: 31051 [2025-03-16 20:08:35,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:35,490 INFO L435 NwaCegarLoop]: 4585 mSDtfsCounter, 4858 mSDsluCounter, 13792 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4876 SdHoareTripleChecker+Valid, 18377 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:35,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4876 Valid, 18377 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:08:35,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31051 states. [2025-03-16 20:08:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31051 to 30536. [2025-03-16 20:08:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30536 states, 28238 states have (on average 1.7084779375309866) internal successors, (48244), 28906 states have internal predecessors, (48244), 1240 states have call successors, (1240), 390 states have call predecessors, (1240), 1056 states have return successors, (5336), 1303 states have call predecessors, (5336), 1240 states have call successors, (5336) [2025-03-16 20:08:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30536 states to 30536 states and 54820 transitions. [2025-03-16 20:08:36,291 INFO L78 Accepts]: Start accepts. Automaton has 30536 states and 54820 transitions. Word has length 141 [2025-03-16 20:08:36,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:36,292 INFO L471 AbstractCegarLoop]: Abstraction has 30536 states and 54820 transitions. [2025-03-16 20:08:36,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:36,293 INFO L276 IsEmpty]: Start isEmpty. Operand 30536 states and 54820 transitions. [2025-03-16 20:08:36,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:08:36,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:36,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:36,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:08:36,303 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:36,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:36,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1487189351, now seen corresponding path program 1 times [2025-03-16 20:08:36,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:36,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593476841] [2025-03-16 20:08:36,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:36,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:36,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:08:36,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:08:36,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:36,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:36,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:36,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:36,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593476841] [2025-03-16 20:08:36,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593476841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:36,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:36,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:36,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826912703] [2025-03-16 20:08:36,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:36,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:36,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:36,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:36,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:36,395 INFO L87 Difference]: Start difference. First operand 30536 states and 54820 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:37,505 INFO L93 Difference]: Finished difference Result 68438 states and 126696 transitions. [2025-03-16 20:08:37,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:37,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:08:37,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:37,794 INFO L225 Difference]: With dead ends: 68438 [2025-03-16 20:08:37,794 INFO L226 Difference]: Without dead ends: 40039 [2025-03-16 20:08:37,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:37,838 INFO L435 NwaCegarLoop]: 4316 mSDtfsCounter, 4610 mSDsluCounter, 8500 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4628 SdHoareTripleChecker+Valid, 12816 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:37,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4628 Valid, 12816 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:08:37,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40039 states. [2025-03-16 20:08:38,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40039 to 30536. [2025-03-16 20:08:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30536 states, 28238 states have (on average 1.7061760747928323) internal successors, (48179), 28906 states have internal predecessors, (48179), 1240 states have call successors, (1240), 390 states have call predecessors, (1240), 1056 states have return successors, (5336), 1303 states have call predecessors, (5336), 1240 states have call successors, (5336) [2025-03-16 20:08:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30536 states to 30536 states and 54755 transitions. [2025-03-16 20:08:39,128 INFO L78 Accepts]: Start accepts. Automaton has 30536 states and 54755 transitions. Word has length 141 [2025-03-16 20:08:39,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:39,130 INFO L471 AbstractCegarLoop]: Abstraction has 30536 states and 54755 transitions. [2025-03-16 20:08:39,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:39,130 INFO L276 IsEmpty]: Start isEmpty. Operand 30536 states and 54755 transitions. [2025-03-16 20:08:39,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:08:39,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:39,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:39,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:08:39,142 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:39,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:39,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1251511176, now seen corresponding path program 1 times [2025-03-16 20:08:39,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:39,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115333074] [2025-03-16 20:08:39,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:39,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:39,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:08:39,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:08:39,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:39,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:39,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:39,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:39,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115333074] [2025-03-16 20:08:39,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115333074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:39,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:39,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:39,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893771655] [2025-03-16 20:08:39,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:39,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:39,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:39,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:39,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:39,274 INFO L87 Difference]: Start difference. First operand 30536 states and 54755 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:42,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:42,032 INFO L93 Difference]: Finished difference Result 100668 states and 187484 transitions. [2025-03-16 20:08:42,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:42,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:08:42,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:42,343 INFO L225 Difference]: With dead ends: 100668 [2025-03-16 20:08:42,343 INFO L226 Difference]: Without dead ends: 72269 [2025-03-16 20:08:42,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:42,430 INFO L435 NwaCegarLoop]: 4575 mSDtfsCounter, 5126 mSDsluCounter, 13758 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5155 SdHoareTripleChecker+Valid, 18333 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:42,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5155 Valid, 18333 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:08:42,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72269 states. [2025-03-16 20:08:45,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72269 to 67152. [2025-03-16 20:08:45,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67152 states, 61924 states have (on average 1.7277469155739293) internal successors, (106989), 63986 states have internal predecessors, (106989), 2392 states have call successors, (2392), 774 states have call predecessors, (2392), 2834 states have return successors, (18776), 2519 states have call predecessors, (18776), 2392 states have call successors, (18776) [2025-03-16 20:08:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67152 states to 67152 states and 128157 transitions. [2025-03-16 20:08:45,380 INFO L78 Accepts]: Start accepts. Automaton has 67152 states and 128157 transitions. Word has length 141 [2025-03-16 20:08:45,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:45,381 INFO L471 AbstractCegarLoop]: Abstraction has 67152 states and 128157 transitions. [2025-03-16 20:08:45,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:45,381 INFO L276 IsEmpty]: Start isEmpty. Operand 67152 states and 128157 transitions. [2025-03-16 20:08:45,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:08:45,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:45,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:45,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:08:45,399 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:45,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:45,400 INFO L85 PathProgramCache]: Analyzing trace with hash -2075192647, now seen corresponding path program 1 times [2025-03-16 20:08:45,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:45,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058982103] [2025-03-16 20:08:45,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:45,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:45,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:08:45,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:08:45,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:45,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:45,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:45,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058982103] [2025-03-16 20:08:45,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058982103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:45,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:45,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:45,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631266281] [2025-03-16 20:08:45,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:45,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:45,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:45,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:45,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:45,477 INFO L87 Difference]: Start difference. First operand 67152 states and 128157 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:48,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:48,532 INFO L93 Difference]: Finished difference Result 156246 states and 310564 transitions. [2025-03-16 20:08:48,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:48,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:08:48,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:48,919 INFO L225 Difference]: With dead ends: 156246 [2025-03-16 20:08:48,919 INFO L226 Difference]: Without dead ends: 91231 [2025-03-16 20:08:49,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:49,088 INFO L435 NwaCegarLoop]: 4311 mSDtfsCounter, 4604 mSDsluCounter, 8489 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4622 SdHoareTripleChecker+Valid, 12800 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:49,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4622 Valid, 12800 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:08:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91231 states. [2025-03-16 20:08:52,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91231 to 67152. [2025-03-16 20:08:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67152 states, 61924 states have (on average 1.7256637168141593) internal successors, (106860), 63986 states have internal predecessors, (106860), 2392 states have call successors, (2392), 774 states have call predecessors, (2392), 2834 states have return successors, (18776), 2519 states have call predecessors, (18776), 2392 states have call successors, (18776) [2025-03-16 20:08:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67152 states to 67152 states and 128028 transitions. [2025-03-16 20:08:52,663 INFO L78 Accepts]: Start accepts. Automaton has 67152 states and 128028 transitions. Word has length 141 [2025-03-16 20:08:52,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:52,664 INFO L471 AbstractCegarLoop]: Abstraction has 67152 states and 128028 transitions. [2025-03-16 20:08:52,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 67152 states and 128028 transitions. [2025-03-16 20:08:52,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:08:52,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:52,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:52,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:08:52,684 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:52,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:52,684 INFO L85 PathProgramCache]: Analyzing trace with hash -993384360, now seen corresponding path program 1 times [2025-03-16 20:08:52,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:52,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000048874] [2025-03-16 20:08:52,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:52,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:52,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:08:52,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:08:52,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:52,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:52,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:52,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000048874] [2025-03-16 20:08:52,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000048874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:52,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:52,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:52,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508165898] [2025-03-16 20:08:52,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:52,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:52,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:52,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:52,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:52,781 INFO L87 Difference]: Start difference. First operand 67152 states and 128028 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:58,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:58,476 INFO L93 Difference]: Finished difference Result 226704 states and 458985 transitions. [2025-03-16 20:08:58,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:58,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:08:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:59,111 INFO L225 Difference]: With dead ends: 226704 [2025-03-16 20:08:59,111 INFO L226 Difference]: Without dead ends: 161689 [2025-03-16 20:08:59,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:59,308 INFO L435 NwaCegarLoop]: 4567 mSDtfsCounter, 5059 mSDsluCounter, 13735 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5088 SdHoareTripleChecker+Valid, 18302 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:59,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5088 Valid, 18302 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:08:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161689 states. [2025-03-16 20:09:06,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161689 to 153314. [2025-03-16 20:09:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153314 states, 140832 states have (on average 1.7469751192910703) internal successors, (246030), 147140 states have internal predecessors, (246030), 4632 states have call successors, (4632), 1542 states have call predecessors, (4632), 7848 states have return successors, (70168), 4887 states have call predecessors, (70168), 4632 states have call successors, (70168) [2025-03-16 20:09:07,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153314 states to 153314 states and 320830 transitions. [2025-03-16 20:09:07,595 INFO L78 Accepts]: Start accepts. Automaton has 153314 states and 320830 transitions. Word has length 141 [2025-03-16 20:09:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:09:07,596 INFO L471 AbstractCegarLoop]: Abstraction has 153314 states and 320830 transitions. [2025-03-16 20:09:07,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:09:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 153314 states and 320830 transitions. [2025-03-16 20:09:07,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:09:07,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:09:07,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:09:07,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:09:07,632 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:09:07,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:09:07,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1512676647, now seen corresponding path program 1 times [2025-03-16 20:09:07,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:09:07,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568683694] [2025-03-16 20:09:07,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:09:07,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:09:07,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:09:07,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:09:07,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:09:07,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:09:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:09:07,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:09:07,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568683694] [2025-03-16 20:09:07,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568683694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:09:07,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:09:07,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:09:07,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037592640] [2025-03-16 20:09:07,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:09:07,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:09:07,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:09:07,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:09:07,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:09:07,707 INFO L87 Difference]: Start difference. First operand 153314 states and 320830 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)