./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_9.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:31:49,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:31:49,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-08 14:31:49,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:31:49,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:31:49,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:31:49,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:31:49,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:31:49,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:31:49,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:31:49,412 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:31:49,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:31:49,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:31:49,413 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:31:49,413 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:31:49,413 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:31:49,413 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:31:49,413 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:31:49,413 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:31:49,413 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:31:49,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:31:49,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:31:49,413 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:31:49,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:31:49,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:31:49,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:31:49,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:31:49,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:31:49,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:31:49,414 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:31:49,414 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:31:49,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:31:49,414 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:31:49,414 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:31:49,414 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:31:49,414 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:31:49,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:31:49,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:31:49,414 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:31:49,414 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:31:49,414 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-jdk21/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(F end) ) 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 -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2025-02-08 14:31:49,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:31:49,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:31:49,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:31:49,661 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:31:49,661 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:31:49,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2025-02-08 14:31:50,758 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/803d5a3ff/023c575954bf416cb498292e6e6b6bcf/FLAG26904a364 [2025-02-08 14:31:51,053 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:31:51,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2025-02-08 14:31:51,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/803d5a3ff/023c575954bf416cb498292e6e6b6bcf/FLAG26904a364 [2025-02-08 14:31:51,333 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/803d5a3ff/023c575954bf416cb498292e6e6b6bcf [2025-02-08 14:31:51,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:31:51,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:31:51,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:31:51,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:31:51,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:31:51,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:31:51" (1/1) ... [2025-02-08 14:31:51,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2823c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:51, skipping insertion in model container [2025-02-08 14:31:51,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:31:51" (1/1) ... [2025-02-08 14:31:51,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:31:51,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:31:51,442 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:31:51,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:31:51,461 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:31:51,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:51 WrapperNode [2025-02-08 14:31:51,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:31:51,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:31:51,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:31:51,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:31:51,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:51" (1/1) ... [2025-02-08 14:31:51,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:51" (1/1) ... [2025-02-08 14:31:51,479 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 124 [2025-02-08 14:31:51,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:31:51,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:31:51,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:31:51,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:31:51,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:51" (1/1) ... [2025-02-08 14:31:51,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:51" (1/1) ... [2025-02-08 14:31:51,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:51" (1/1) ... [2025-02-08 14:31:51,491 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-02-08 14:31:51,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:51" (1/1) ... [2025-02-08 14:31:51,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:51" (1/1) ... [2025-02-08 14:31:51,493 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:51" (1/1) ... [2025-02-08 14:31:51,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:51" (1/1) ... [2025-02-08 14:31:51,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:51" (1/1) ... [2025-02-08 14:31:51,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:51" (1/1) ... [2025-02-08 14:31:51,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:31:51,495 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:31:51,496 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:31:51,496 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:31:51,496 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:51" (1/1) ... [2025-02-08 14:31:51,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:31:51,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:31:51,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:31:51,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:31:51,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:31:51,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:31:51,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:31:51,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:31:51,576 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:31:51,577 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:31:51,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149: assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false;main_#res#1 := 0; [2025-02-08 14:31:51,694 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-08 14:31:51,694 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:31:51,699 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:31:51,700 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:31:51,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:31:51 BoogieIcfgContainer [2025-02-08 14:31:51,700 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:31:51,701 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:31:51,701 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:31:51,704 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:31:51,705 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:31:51,705 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:31:51" (1/3) ... [2025-02-08 14:31:51,705 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49c1ffaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:31:51, skipping insertion in model container [2025-02-08 14:31:51,705 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:31:51,706 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:51" (2/3) ... [2025-02-08 14:31:51,706 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49c1ffaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:31:51, skipping insertion in model container [2025-02-08 14:31:51,706 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:31:51,706 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:31:51" (3/3) ... [2025-02-08 14:31:51,707 INFO L363 chiAutomizerObserver]: Analyzing ICFG test_locks_9.c [2025-02-08 14:31:51,737 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:31:51,737 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:31:51,737 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:31:51,737 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:31:51,737 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:31:51,737 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:31:51,737 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:31:51,737 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:31:51,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 32 states have (on average 1.90625) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:51,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2025-02-08 14:31:51,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:31:51,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:31:51,752 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:31:51,752 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:31:51,752 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:31:51,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 32 states have (on average 1.90625) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:51,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2025-02-08 14:31:51,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:31:51,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:31:51,754 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:31:51,754 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:31:51,757 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1;" [2025-02-08 14:31:51,757 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;" "assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1;" "assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1;" "assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1;" "assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1;" "assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1;" "assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1;" "assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1;" "assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1;" "assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" [2025-02-08 14:31:51,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:51,760 INFO L85 PathProgramCache]: Analyzing trace with hash 123, now seen corresponding path program 1 times [2025-02-08 14:31:51,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:51,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989512507] [2025-02-08 14:31:51,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:31:51,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:51,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:51,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:51,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:51,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:51,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:31:51,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:51,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:51,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:51,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:51,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:31:51,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:51,830 INFO L85 PathProgramCache]: Analyzing trace with hash 344193659, now seen corresponding path program 1 times [2025-02-08 14:31:51,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:51,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33487155] [2025-02-08 14:31:51,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:31:51,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:51,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:31:51,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:31:51,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:51,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:31:51,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:31:51,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:31:51,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33487155] [2025-02-08 14:31:51,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33487155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:31:51,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:31:51,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:31:51,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899502519] [2025-02-08 14:31:51,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:31:51,894 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:31:51,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:31:51,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:31:51,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:31:51,934 INFO L87 Difference]: Start difference. First operand has 35 states, 32 states have (on average 1.90625) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:51,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:31:51,972 INFO L93 Difference]: Finished difference Result 62 states and 111 transitions. [2025-02-08 14:31:51,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 111 transitions. [2025-02-08 14:31:51,974 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2025-02-08 14:31:51,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 58 states and 92 transitions. [2025-02-08 14:31:51,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2025-02-08 14:31:51,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2025-02-08 14:31:51,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 92 transitions. [2025-02-08 14:31:51,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:31:51,983 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 92 transitions. [2025-02-08 14:31:51,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 92 transitions. [2025-02-08 14:31:52,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-02-08 14:31:52,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 57 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 92 transitions. [2025-02-08 14:31:52,006 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 92 transitions. [2025-02-08 14:31:52,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:31:52,011 INFO L432 stractBuchiCegarLoop]: Abstraction has 58 states and 92 transitions. [2025-02-08 14:31:52,011 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:31:52,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 92 transitions. [2025-02-08 14:31:52,012 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2025-02-08 14:31:52,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:31:52,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:31:52,015 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:31:52,015 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:31:52,015 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1;" [2025-02-08 14:31:52,015 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1;" "assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1;" "assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1;" "assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1;" "assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1;" "assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1;" "assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1;" "assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" [2025-02-08 14:31:52,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:52,015 INFO L85 PathProgramCache]: Analyzing trace with hash 123, now seen corresponding path program 2 times [2025-02-08 14:31:52,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:52,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781828668] [2025-02-08 14:31:52,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:31:52,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:52,021 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:52,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:52,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:31:52,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:52,026 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:31:52,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:52,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:52,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:52,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:52,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:31:52,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:52,034 INFO L85 PathProgramCache]: Analyzing trace with hash -652878694, now seen corresponding path program 1 times [2025-02-08 14:31:52,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:52,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826731126] [2025-02-08 14:31:52,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:31:52,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:52,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:31:52,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:31:52,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:52,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:31:52,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:31:52,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:31:52,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826731126] [2025-02-08 14:31:52,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826731126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:31:52,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:31:52,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:31:52,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533058394] [2025-02-08 14:31:52,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:31:52,083 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:31:52,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:31:52,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:31:52,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:31:52,085 INFO L87 Difference]: Start difference. First operand 58 states and 92 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:31:52,104 INFO L93 Difference]: Finished difference Result 113 states and 177 transitions. [2025-02-08 14:31:52,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 177 transitions. [2025-02-08 14:31:52,106 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2025-02-08 14:31:52,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 113 states and 177 transitions. [2025-02-08 14:31:52,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2025-02-08 14:31:52,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2025-02-08 14:31:52,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 177 transitions. [2025-02-08 14:31:52,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:31:52,111 INFO L218 hiAutomatonCegarLoop]: Abstraction has 113 states and 177 transitions. [2025-02-08 14:31:52,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 177 transitions. [2025-02-08 14:31:52,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-02-08 14:31:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.5663716814159292) internal successors, (177), 112 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 177 transitions. [2025-02-08 14:31:52,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 113 states and 177 transitions. [2025-02-08 14:31:52,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:31:52,121 INFO L432 stractBuchiCegarLoop]: Abstraction has 113 states and 177 transitions. [2025-02-08 14:31:52,121 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:31:52,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 177 transitions. [2025-02-08 14:31:52,124 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2025-02-08 14:31:52,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:31:52,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:31:52,124 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:31:52,124 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:31:52,124 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1;" [2025-02-08 14:31:52,126 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1;" "assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1;" "assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1;" "assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1;" "assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1;" "assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1;" "assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" [2025-02-08 14:31:52,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:52,127 INFO L85 PathProgramCache]: Analyzing trace with hash 123, now seen corresponding path program 3 times [2025-02-08 14:31:52,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:52,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419995734] [2025-02-08 14:31:52,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:31:52,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:52,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:52,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:52,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:31:52,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:52,138 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:31:52,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:52,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:52,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:52,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:52,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:31:52,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:52,146 INFO L85 PathProgramCache]: Analyzing trace with hash 700431003, now seen corresponding path program 1 times [2025-02-08 14:31:52,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:52,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282286301] [2025-02-08 14:31:52,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:31:52,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:52,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:31:52,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:31:52,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:52,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:31:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:31:52,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:31:52,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282286301] [2025-02-08 14:31:52,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282286301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:31:52,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:31:52,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:31:52,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943360679] [2025-02-08 14:31:52,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:31:52,182 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:31:52,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:31:52,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:31:52,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:31:52,183 INFO L87 Difference]: Start difference. First operand 113 states and 177 transitions. cyclomatic complexity: 68 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:52,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:31:52,196 INFO L93 Difference]: Finished difference Result 221 states and 341 transitions. [2025-02-08 14:31:52,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 221 states and 341 transitions. [2025-02-08 14:31:52,198 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2025-02-08 14:31:52,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 221 states to 221 states and 341 transitions. [2025-02-08 14:31:52,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 221 [2025-02-08 14:31:52,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2025-02-08 14:31:52,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 221 states and 341 transitions. [2025-02-08 14:31:52,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:31:52,200 INFO L218 hiAutomatonCegarLoop]: Abstraction has 221 states and 341 transitions. [2025-02-08 14:31:52,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states and 341 transitions. [2025-02-08 14:31:52,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2025-02-08 14:31:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 221 states have (on average 1.5429864253393666) internal successors, (341), 220 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 341 transitions. [2025-02-08 14:31:52,208 INFO L240 hiAutomatonCegarLoop]: Abstraction has 221 states and 341 transitions. [2025-02-08 14:31:52,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:31:52,209 INFO L432 stractBuchiCegarLoop]: Abstraction has 221 states and 341 transitions. [2025-02-08 14:31:52,209 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:31:52,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 221 states and 341 transitions. [2025-02-08 14:31:52,211 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2025-02-08 14:31:52,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:31:52,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:31:52,211 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:31:52,211 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:31:52,211 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1;" [2025-02-08 14:31:52,211 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1;" "assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1;" "assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1;" "assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1;" "assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1;" "assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" [2025-02-08 14:31:52,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash 123, now seen corresponding path program 4 times [2025-02-08 14:31:52,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:52,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012729323] [2025-02-08 14:31:52,212 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:31:52,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:52,216 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-02-08 14:31:52,217 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:52,217 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:31:52,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:52,217 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:31:52,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:52,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:52,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:52,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:52,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:31:52,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:52,221 INFO L85 PathProgramCache]: Analyzing trace with hash 189896826, now seen corresponding path program 1 times [2025-02-08 14:31:52,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:52,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664435074] [2025-02-08 14:31:52,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:31:52,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:52,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:31:52,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:31:52,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:52,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:31:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:31:52,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:31:52,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664435074] [2025-02-08 14:31:52,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664435074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:31:52,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:31:52,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:31:52,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176530038] [2025-02-08 14:31:52,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:31:52,243 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:31:52,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:31:52,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:31:52,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:31:52,243 INFO L87 Difference]: Start difference. First operand 221 states and 341 transitions. cyclomatic complexity: 128 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:52,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:31:52,256 INFO L93 Difference]: Finished difference Result 433 states and 657 transitions. [2025-02-08 14:31:52,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 433 states and 657 transitions. [2025-02-08 14:31:52,261 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2025-02-08 14:31:52,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 433 states to 433 states and 657 transitions. [2025-02-08 14:31:52,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 433 [2025-02-08 14:31:52,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 433 [2025-02-08 14:31:52,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 433 states and 657 transitions. [2025-02-08 14:31:52,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:31:52,266 INFO L218 hiAutomatonCegarLoop]: Abstraction has 433 states and 657 transitions. [2025-02-08 14:31:52,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states and 657 transitions. [2025-02-08 14:31:52,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2025-02-08 14:31:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 433 states have (on average 1.5173210161662818) internal successors, (657), 432 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 657 transitions. [2025-02-08 14:31:52,308 INFO L240 hiAutomatonCegarLoop]: Abstraction has 433 states and 657 transitions. [2025-02-08 14:31:52,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:31:52,312 INFO L432 stractBuchiCegarLoop]: Abstraction has 433 states and 657 transitions. [2025-02-08 14:31:52,313 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:31:52,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 433 states and 657 transitions. [2025-02-08 14:31:52,317 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2025-02-08 14:31:52,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:31:52,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:31:52,317 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:31:52,318 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:31:52,318 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1;" [2025-02-08 14:31:52,318 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1;" "assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1;" "assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1;" "assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1;" "assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" [2025-02-08 14:31:52,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:52,319 INFO L85 PathProgramCache]: Analyzing trace with hash 123, now seen corresponding path program 5 times [2025-02-08 14:31:52,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:52,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064533674] [2025-02-08 14:31:52,319 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:31:52,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:52,325 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:52,328 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:52,328 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:31:52,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:52,329 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:31:52,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:52,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:52,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:52,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:52,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:31:52,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:52,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1697448635, now seen corresponding path program 1 times [2025-02-08 14:31:52,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:52,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198843403] [2025-02-08 14:31:52,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:31:52,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:52,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:31:52,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:31:52,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:52,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:31:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:31:52,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:31:52,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198843403] [2025-02-08 14:31:52,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198843403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:31:52,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:31:52,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:31:52,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778049651] [2025-02-08 14:31:52,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:31:52,376 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:31:52,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:31:52,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:31:52,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:31:52,377 INFO L87 Difference]: Start difference. First operand 433 states and 657 transitions. cyclomatic complexity: 240 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:31:52,402 INFO L93 Difference]: Finished difference Result 849 states and 1265 transitions. [2025-02-08 14:31:52,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 849 states and 1265 transitions. [2025-02-08 14:31:52,410 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2025-02-08 14:31:52,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 849 states to 849 states and 1265 transitions. [2025-02-08 14:31:52,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 849 [2025-02-08 14:31:52,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 849 [2025-02-08 14:31:52,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 849 states and 1265 transitions. [2025-02-08 14:31:52,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:31:52,425 INFO L218 hiAutomatonCegarLoop]: Abstraction has 849 states and 1265 transitions. [2025-02-08 14:31:52,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states and 1265 transitions. [2025-02-08 14:31:52,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2025-02-08 14:31:52,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 849 states have (on average 1.4899882214369846) internal successors, (1265), 848 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:52,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1265 transitions. [2025-02-08 14:31:52,457 INFO L240 hiAutomatonCegarLoop]: Abstraction has 849 states and 1265 transitions. [2025-02-08 14:31:52,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:31:52,458 INFO L432 stractBuchiCegarLoop]: Abstraction has 849 states and 1265 transitions. [2025-02-08 14:31:52,458 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:31:52,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 849 states and 1265 transitions. [2025-02-08 14:31:52,462 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2025-02-08 14:31:52,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:31:52,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:31:52,467 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:31:52,467 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:31:52,467 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1;" [2025-02-08 14:31:52,467 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1;" "assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1;" "assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1;" "assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" [2025-02-08 14:31:52,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash 123, now seen corresponding path program 6 times [2025-02-08 14:31:52,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:52,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970377672] [2025-02-08 14:31:52,472 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:31:52,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:52,475 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:52,480 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:52,481 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 14:31:52,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:52,481 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:31:52,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:52,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:52,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:52,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:52,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:31:52,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:52,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1191890010, now seen corresponding path program 1 times [2025-02-08 14:31:52,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:52,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426655003] [2025-02-08 14:31:52,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:31:52,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:52,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:31:52,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:31:52,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:52,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:31:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:31:52,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:31:52,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426655003] [2025-02-08 14:31:52,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426655003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:31:52,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:31:52,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:31:52,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743545285] [2025-02-08 14:31:52,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:31:52,528 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:31:52,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:31:52,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:31:52,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:31:52,529 INFO L87 Difference]: Start difference. First operand 849 states and 1265 transitions. cyclomatic complexity: 448 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:52,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:31:52,550 INFO L93 Difference]: Finished difference Result 1665 states and 2433 transitions. [2025-02-08 14:31:52,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1665 states and 2433 transitions. [2025-02-08 14:31:52,562 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2025-02-08 14:31:52,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1665 states to 1665 states and 2433 transitions. [2025-02-08 14:31:52,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1665 [2025-02-08 14:31:52,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1665 [2025-02-08 14:31:52,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1665 states and 2433 transitions. [2025-02-08 14:31:52,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:31:52,578 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1665 states and 2433 transitions. [2025-02-08 14:31:52,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states and 2433 transitions. [2025-02-08 14:31:52,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2025-02-08 14:31:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1665 states have (on average 1.4612612612612612) internal successors, (2433), 1664 states have internal predecessors, (2433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2433 transitions. [2025-02-08 14:31:52,609 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1665 states and 2433 transitions. [2025-02-08 14:31:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:31:52,614 INFO L432 stractBuchiCegarLoop]: Abstraction has 1665 states and 2433 transitions. [2025-02-08 14:31:52,614 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:31:52,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1665 states and 2433 transitions. [2025-02-08 14:31:52,620 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2025-02-08 14:31:52,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:31:52,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:31:52,623 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:31:52,623 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:31:52,623 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1;" [2025-02-08 14:31:52,623 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1;" "assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1;" "assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" [2025-02-08 14:31:52,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:52,624 INFO L85 PathProgramCache]: Analyzing trace with hash 123, now seen corresponding path program 7 times [2025-02-08 14:31:52,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:52,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443504838] [2025-02-08 14:31:52,624 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 14:31:52,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:52,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:52,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:52,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:52,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:52,630 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:31:52,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:52,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:52,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:52,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:52,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:31:52,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:52,637 INFO L85 PathProgramCache]: Analyzing trace with hash 898487003, now seen corresponding path program 1 times [2025-02-08 14:31:52,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:52,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624238937] [2025-02-08 14:31:52,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:31:52,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:52,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:31:52,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:31:52,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:52,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:31:52,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:31:52,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:31:52,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624238937] [2025-02-08 14:31:52,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624238937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:31:52,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:31:52,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:31:52,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972452948] [2025-02-08 14:31:52,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:31:52,663 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:31:52,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:31:52,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:31:52,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:31:52,664 INFO L87 Difference]: Start difference. First operand 1665 states and 2433 transitions. cyclomatic complexity: 832 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:52,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:31:52,695 INFO L93 Difference]: Finished difference Result 3265 states and 4673 transitions. [2025-02-08 14:31:52,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3265 states and 4673 transitions. [2025-02-08 14:31:52,710 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2025-02-08 14:31:52,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3265 states to 3265 states and 4673 transitions. [2025-02-08 14:31:52,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3265 [2025-02-08 14:31:52,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3265 [2025-02-08 14:31:52,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3265 states and 4673 transitions. [2025-02-08 14:31:52,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:31:52,727 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3265 states and 4673 transitions. [2025-02-08 14:31:52,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states and 4673 transitions. [2025-02-08 14:31:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 3265. [2025-02-08 14:31:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3265 states, 3265 states have (on average 1.431240428790199) internal successors, (4673), 3264 states have internal predecessors, (4673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3265 states to 3265 states and 4673 transitions. [2025-02-08 14:31:52,799 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3265 states and 4673 transitions. [2025-02-08 14:31:52,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:31:52,801 INFO L432 stractBuchiCegarLoop]: Abstraction has 3265 states and 4673 transitions. [2025-02-08 14:31:52,801 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-08 14:31:52,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3265 states and 4673 transitions. [2025-02-08 14:31:52,811 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2025-02-08 14:31:52,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:31:52,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:31:52,813 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:31:52,813 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:31:52,813 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1;" [2025-02-08 14:31:52,813 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1;" "assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" [2025-02-08 14:31:52,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:52,814 INFO L85 PathProgramCache]: Analyzing trace with hash 123, now seen corresponding path program 8 times [2025-02-08 14:31:52,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:52,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966338342] [2025-02-08 14:31:52,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:31:52,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:52,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:52,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:52,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:31:52,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:52,817 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:31:52,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:52,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:52,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:52,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:52,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:31:52,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:52,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1027569722, now seen corresponding path program 1 times [2025-02-08 14:31:52,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:52,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944220959] [2025-02-08 14:31:52,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:31:52,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:52,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:31:52,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:31:52,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:52,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:31:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:31:52,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:31:52,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944220959] [2025-02-08 14:31:52,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944220959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:31:52,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:31:52,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:31:52,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748895817] [2025-02-08 14:31:52,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:31:52,850 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:31:52,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:31:52,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:31:52,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:31:52,851 INFO L87 Difference]: Start difference. First operand 3265 states and 4673 transitions. cyclomatic complexity: 1536 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:52,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:31:52,884 INFO L93 Difference]: Finished difference Result 6401 states and 8961 transitions. [2025-02-08 14:31:52,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6401 states and 8961 transitions. [2025-02-08 14:31:52,916 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2025-02-08 14:31:52,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6401 states to 6401 states and 8961 transitions. [2025-02-08 14:31:52,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6401 [2025-02-08 14:31:52,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6401 [2025-02-08 14:31:52,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6401 states and 8961 transitions. [2025-02-08 14:31:52,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:31:52,947 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6401 states and 8961 transitions. [2025-02-08 14:31:52,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6401 states and 8961 transitions. [2025-02-08 14:31:53,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6401 to 6401. [2025-02-08 14:31:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6401 states, 6401 states have (on average 1.3999375097640994) internal successors, (8961), 6400 states have internal predecessors, (8961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:53,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6401 states to 6401 states and 8961 transitions. [2025-02-08 14:31:53,066 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6401 states and 8961 transitions. [2025-02-08 14:31:53,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:31:53,069 INFO L432 stractBuchiCegarLoop]: Abstraction has 6401 states and 8961 transitions. [2025-02-08 14:31:53,069 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-08 14:31:53,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6401 states and 8961 transitions. [2025-02-08 14:31:53,087 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2025-02-08 14:31:53,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:31:53,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:31:53,088 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:31:53,088 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:31:53,088 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1;" [2025-02-08 14:31:53,088 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" [2025-02-08 14:31:53,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:53,089 INFO L85 PathProgramCache]: Analyzing trace with hash 123, now seen corresponding path program 9 times [2025-02-08 14:31:53,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:53,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195090771] [2025-02-08 14:31:53,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:31:53,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:53,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:53,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:53,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:31:53,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:53,095 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:31:53,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:53,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:53,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:53,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:53,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:31:53,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:53,100 INFO L85 PathProgramCache]: Analyzing trace with hash -769381637, now seen corresponding path program 1 times [2025-02-08 14:31:53,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:53,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909019783] [2025-02-08 14:31:53,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:31:53,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:53,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:31:53,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:31:53,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:53,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:31:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:31:53,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:31:53,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909019783] [2025-02-08 14:31:53,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909019783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:31:53,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:31:53,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:31:53,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603071272] [2025-02-08 14:31:53,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:31:53,124 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:31:53,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:31:53,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:31:53,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:31:53,126 INFO L87 Difference]: Start difference. First operand 6401 states and 8961 transitions. cyclomatic complexity: 2816 Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:53,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:31:53,218 INFO L93 Difference]: Finished difference Result 12545 states and 17153 transitions. [2025-02-08 14:31:53,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12545 states and 17153 transitions. [2025-02-08 14:31:53,277 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 12544 [2025-02-08 14:31:53,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12545 states to 12545 states and 17153 transitions. [2025-02-08 14:31:53,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12545 [2025-02-08 14:31:53,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12545 [2025-02-08 14:31:53,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12545 states and 17153 transitions. [2025-02-08 14:31:53,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:31:53,347 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12545 states and 17153 transitions. [2025-02-08 14:31:53,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12545 states and 17153 transitions. [2025-02-08 14:31:53,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12545 to 12545. [2025-02-08 14:31:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12545 states, 12545 states have (on average 1.3673176564368275) internal successors, (17153), 12544 states have internal predecessors, (17153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12545 states to 12545 states and 17153 transitions. [2025-02-08 14:31:53,534 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12545 states and 17153 transitions. [2025-02-08 14:31:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:31:53,536 INFO L432 stractBuchiCegarLoop]: Abstraction has 12545 states and 17153 transitions. [2025-02-08 14:31:53,536 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-08 14:31:53,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12545 states and 17153 transitions. [2025-02-08 14:31:53,576 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 12544 [2025-02-08 14:31:53,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:31:53,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:31:53,578 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:31:53,578 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:31:53,578 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1;" [2025-02-08 14:31:53,578 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" [2025-02-08 14:31:53,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:53,578 INFO L85 PathProgramCache]: Analyzing trace with hash 123, now seen corresponding path program 10 times [2025-02-08 14:31:53,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:53,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839652394] [2025-02-08 14:31:53,579 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:31:53,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:53,581 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-02-08 14:31:53,587 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:53,587 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:31:53,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:53,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:31:53,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:53,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:53,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:53,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:53,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:31:53,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:53,589 INFO L85 PathProgramCache]: Analyzing trace with hash -965895142, now seen corresponding path program 1 times [2025-02-08 14:31:53,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:53,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957709283] [2025-02-08 14:31:53,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:31:53,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:53,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:31:53,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:31:53,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:53,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:53,597 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:31:53,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:31:53,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:31:53,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:53,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:53,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:31:53,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:31:53,604 INFO L85 PathProgramCache]: Analyzing trace with hash -950887532, now seen corresponding path program 1 times [2025-02-08 14:31:53,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:31:53,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404554499] [2025-02-08 14:31:53,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:31:53,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:31:53,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 14:31:53,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:31:53,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:53,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:53,613 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:31:53,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 14:31:53,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:31:53,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:53,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:53,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:31:54,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:54,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:54,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:54,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:54,087 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:31:54,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:31:54,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:31:54,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:31:54,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:31:54,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:31:54 BoogieIcfgContainer [2025-02-08 14:31:54,124 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:31:54,125 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:31:54,125 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:31:54,125 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:31:54,126 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:31:51" (3/4) ... [2025-02-08 14:31:54,127 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-02-08 14:31:54,157 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 14:31:54,157 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:31:54,159 INFO L158 Benchmark]: Toolchain (without parser) took 2822.69ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 115.1MB in the beginning and 241.9MB in the end (delta: -126.8MB). Peak memory consumption was 67.8MB. Max. memory is 16.1GB. [2025-02-08 14:31:54,159 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:31:54,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 126.05ms. Allocated memory is still 142.6MB. Free memory was 115.1MB in the beginning and 103.0MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:31:54,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.18ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 101.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:31:54,160 INFO L158 Benchmark]: Boogie Preprocessor took 14.99ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 100.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:31:54,160 INFO L158 Benchmark]: IcfgBuilder took 204.72ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 87.4MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:31:54,161 INFO L158 Benchmark]: BuchiAutomizer took 2423.58ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 87.4MB in the beginning and 244.7MB in the end (delta: -157.3MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2025-02-08 14:31:54,161 INFO L158 Benchmark]: Witness Printer took 32.72ms. Allocated memory is still 335.5MB. Free memory was 244.7MB in the beginning and 241.9MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:31:54,162 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 126.05ms. Allocated memory is still 142.6MB. Free memory was 115.1MB in the beginning and 103.0MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.18ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 101.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.99ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 100.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 204.72ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 87.4MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 2423.58ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 87.4MB in the beginning and 244.7MB in the end (delta: -157.3MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. * Witness Printer took 32.72ms. Allocated memory is still 335.5MB. Free memory was 244.7MB in the beginning and 241.9MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 12545 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 334 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 334 mSDsluCounter, 1027 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 387 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 640 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI9 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 38]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L36] int cond; Loop: [L38] COND TRUE 1 [L39] cond = __VERIFIER_nondet_int() [L40] COND FALSE !(cond == 0) [L43] lk1 = 0 [L45] lk2 = 0 [L47] lk3 = 0 [L49] lk4 = 0 [L51] lk5 = 0 [L53] lk6 = 0 [L55] lk7 = 0 [L57] lk8 = 0 [L59] lk9 = 0 [L63] COND FALSE !(p1 != 0) [L67] COND FALSE !(p2 != 0) [L71] COND FALSE !(p3 != 0) [L75] COND FALSE !(p4 != 0) [L79] COND FALSE !(p5 != 0) [L83] COND FALSE !(p6 != 0) [L87] COND FALSE !(p7 != 0) [L91] COND FALSE !(p8 != 0) [L95] COND FALSE !(p9 != 0) [L101] COND FALSE !(p1 != 0) [L106] COND FALSE !(p2 != 0) [L111] COND FALSE !(p3 != 0) [L116] COND FALSE !(p4 != 0) [L121] COND FALSE !(p5 != 0) [L126] COND FALSE !(p6 != 0) [L131] COND FALSE !(p7 != 0) [L136] COND FALSE !(p8 != 0) [L141] COND FALSE !(p9 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 38]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L36] int cond; Loop: [L38] COND TRUE 1 [L39] cond = __VERIFIER_nondet_int() [L40] COND FALSE !(cond == 0) [L43] lk1 = 0 [L45] lk2 = 0 [L47] lk3 = 0 [L49] lk4 = 0 [L51] lk5 = 0 [L53] lk6 = 0 [L55] lk7 = 0 [L57] lk8 = 0 [L59] lk9 = 0 [L63] COND FALSE !(p1 != 0) [L67] COND FALSE !(p2 != 0) [L71] COND FALSE !(p3 != 0) [L75] COND FALSE !(p4 != 0) [L79] COND FALSE !(p5 != 0) [L83] COND FALSE !(p6 != 0) [L87] COND FALSE !(p7 != 0) [L91] COND FALSE !(p8 != 0) [L95] COND FALSE !(p9 != 0) [L101] COND FALSE !(p1 != 0) [L106] COND FALSE !(p2 != 0) [L111] COND FALSE !(p3 != 0) [L116] COND FALSE !(p4 != 0) [L121] COND FALSE !(p5 != 0) [L126] COND FALSE !(p6 != 0) [L131] COND FALSE !(p7 != 0) [L136] COND FALSE !(p8 != 0) [L141] COND FALSE !(p9 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-02-08 14:31:54,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)