./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_7.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:32:28,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:32:28,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 15:32:28,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:32:28,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:32:28,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:32:28,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:32:28,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:32:28,648 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:32:28,648 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:32:28,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:32:28,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:32:28,650 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:32:28,650 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:32:28,650 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:32:28,651 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:32:28,651 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:32:28,651 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:32:28,652 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:32:28,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:32:28,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:32:28,653 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 15:32:28,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:32:28,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 15:32:28,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:32:28,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:32:28,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:32:28,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:32:28,655 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:32:28,656 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:32:28,656 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 15:32:28,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:32:28,657 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:32:28,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:32:28,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:32:28,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:32:28,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:32:28,658 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:32:28,659 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:32:28,659 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(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 -> 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 [2024-11-09 15:32:28,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:32:28,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:32:28,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:32:28,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:32:28,949 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:32:28,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_7.c [2024-11-09 15:32:30,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:32:30,600 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:32:30,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2024-11-09 15:32:30,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/313065f78/ce36f1fa0ca746d894d921c5bd19b595/FLAG47f585ff8 [2024-11-09 15:32:30,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/313065f78/ce36f1fa0ca746d894d921c5bd19b595 [2024-11-09 15:32:30,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:32:30,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:32:30,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:32:30,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:32:30,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:32:30,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:32:30" (1/1) ... [2024-11-09 15:32:30,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f955aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:30, skipping insertion in model container [2024-11-09 15:32:30,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:32:30" (1/1) ... [2024-11-09 15:32:30,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:32:30,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:32:30,849 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:32:30,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:32:30,882 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:32:30,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:30 WrapperNode [2024-11-09 15:32:30,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:32:30,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:32:30,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:32:30,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:32:30,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:30" (1/1) ... [2024-11-09 15:32:30,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:30" (1/1) ... [2024-11-09 15:32:30,922 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 105 [2024-11-09 15:32:30,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:32:30,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:32:30,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:32:30,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:32:30,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:30" (1/1) ... [2024-11-09 15:32:30,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:30" (1/1) ... [2024-11-09 15:32:30,935 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:30" (1/1) ... [2024-11-09 15:32:30,944 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]. [2024-11-09 15:32:30,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:30" (1/1) ... [2024-11-09 15:32:30,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:30" (1/1) ... [2024-11-09 15:32:30,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:30" (1/1) ... [2024-11-09 15:32:30,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:30" (1/1) ... [2024-11-09 15:32:30,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:30" (1/1) ... [2024-11-09 15:32:30,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:30" (1/1) ... [2024-11-09 15:32:30,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:32:30,955 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:32:30,955 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:32:30,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:32:30,956 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:30" (1/1) ... [2024-11-09 15:32:30,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:30,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:31,008 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:31,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:32:31,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 15:32:31,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:32:31,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:32:31,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 15:32:31,120 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:32:31,121 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:32:31,288 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-09 15:32:31,288 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:32:31,299 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:32:31,299 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 15:32:31,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:32:31 BoogieIcfgContainer [2024-11-09 15:32:31,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:32:31,300 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:32:31,300 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:32:31,303 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:32:31,304 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:32:31,304 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:32:30" (1/3) ... [2024-11-09 15:32:31,305 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7791866f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:32:31, skipping insertion in model container [2024-11-09 15:32:31,305 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:32:31,305 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:30" (2/3) ... [2024-11-09 15:32:31,306 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7791866f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:32:31, skipping insertion in model container [2024-11-09 15:32:31,306 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:32:31,306 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:32:31" (3/3) ... [2024-11-09 15:32:31,307 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_7.c [2024-11-09 15:32:31,359 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:32:31,359 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:32:31,359 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:32:31,359 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:32:31,359 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:32:31,359 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:32:31,359 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:32:31,360 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:32:31,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 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) [2024-11-09 15:32:31,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-11-09 15:32:31,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:31,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:31,383 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:31,383 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:31,383 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:32:31,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 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) [2024-11-09 15:32:31,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-11-09 15:32:31,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:31,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:31,386 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:31,386 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:31,394 INFO L745 eck$LassoCheckResult]: Stem: 29#$Ultimate##0true 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); 5#L-1true 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_~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_~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_~cond~0#1; 17#L113-1true [2024-11-09 15:32:31,394 INFO L747 eck$LassoCheckResult]: Loop: 17#L113-1true assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 27#L34true 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; 30#L53true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 3#L53-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 13#L57-1true assume !(0 != main_~p3~0#1); 9#L61-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 24#L65-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 26#L69-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 11#L73-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 23#L77-1true assume !(0 != main_~p1~0#1); 31#L83-1true assume !(0 != main_~p2~0#1); 15#L88-1true assume !(0 != main_~p3~0#1); 10#L93-1true assume !(0 != main_~p4~0#1); 16#L98-1true assume !(0 != main_~p5~0#1); 7#L103-1true assume !(0 != main_~p6~0#1); 14#L108-1true assume !(0 != main_~p7~0#1); 17#L113-1true [2024-11-09 15:32:31,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:31,401 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:32:31,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:31,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827822352] [2024-11-09 15:32:31,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:31,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:31,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:31,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:31,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:31,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2067454588, now seen corresponding path program 1 times [2024-11-09 15:32:31,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:31,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557465079] [2024-11-09 15:32:31,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:31,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:31,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:32:31,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:31,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557465079] [2024-11-09 15:32:31,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557465079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:31,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:31,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:31,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040065711] [2024-11-09 15:32:31,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:31,634 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:31,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:31,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:31,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:31,679 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 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 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2024-11-09 15:32:31,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:31,712 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2024-11-09 15:32:31,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 93 transitions. [2024-11-09 15:32:31,731 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2024-11-09 15:32:31,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 47 states and 73 transitions. [2024-11-09 15:32:31,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2024-11-09 15:32:31,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2024-11-09 15:32:31,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 73 transitions. [2024-11-09 15:32:31,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:31,737 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 73 transitions. [2024-11-09 15:32:31,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 73 transitions. [2024-11-09 15:32:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-09 15:32:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.553191489361702) internal successors, (73), 46 states have internal predecessors, (73), 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) [2024-11-09 15:32:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2024-11-09 15:32:31,761 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 73 transitions. [2024-11-09 15:32:31,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:31,766 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2024-11-09 15:32:31,766 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:32:31,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 73 transitions. [2024-11-09 15:32:31,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2024-11-09 15:32:31,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:31,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:31,769 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:31,769 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:31,770 INFO L745 eck$LassoCheckResult]: Stem: 120#$Ultimate##0 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); 99#L-1 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_~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_~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_~cond~0#1; 100#L113-1 [2024-11-09 15:32:31,770 INFO L747 eck$LassoCheckResult]: Loop: 100#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 115#L34 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; 119#L53 assume !(0 != main_~p1~0#1); 122#L53-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 141#L57-1 assume !(0 != main_~p3~0#1); 140#L61-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 139#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 138#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 137#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 136#L77-1 assume !(0 != main_~p1~0#1); 135#L83-1 assume !(0 != main_~p2~0#1); 133#L88-1 assume !(0 != main_~p3~0#1); 131#L93-1 assume !(0 != main_~p4~0#1); 128#L98-1 assume !(0 != main_~p5~0#1); 103#L103-1 assume !(0 != main_~p6~0#1); 105#L108-1 assume !(0 != main_~p7~0#1); 100#L113-1 [2024-11-09 15:32:31,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:31,771 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-09 15:32:31,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:31,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419439052] [2024-11-09 15:32:31,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:31,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:31,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:31,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:31,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:31,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1216395458, now seen corresponding path program 1 times [2024-11-09 15:32:31,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:31,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856695978] [2024-11-09 15:32:31,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:31,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:32:31,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:31,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856695978] [2024-11-09 15:32:31,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856695978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:31,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:31,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:31,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014419309] [2024-11-09 15:32:31,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:31,828 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:31,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:31,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:31,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:31,830 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2024-11-09 15:32:31,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:31,850 INFO L93 Difference]: Finished difference Result 90 states and 138 transitions. [2024-11-09 15:32:31,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 138 transitions. [2024-11-09 15:32:31,853 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2024-11-09 15:32:31,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 138 transitions. [2024-11-09 15:32:31,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2024-11-09 15:32:31,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2024-11-09 15:32:31,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 138 transitions. [2024-11-09 15:32:31,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:31,856 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 138 transitions. [2024-11-09 15:32:31,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 138 transitions. [2024-11-09 15:32:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-09 15:32:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 89 states have internal predecessors, (138), 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) [2024-11-09 15:32:31,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2024-11-09 15:32:31,868 INFO L240 hiAutomatonCegarLoop]: Abstraction has 90 states and 138 transitions. [2024-11-09 15:32:31,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:31,869 INFO L425 stractBuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2024-11-09 15:32:31,870 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:32:31,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 138 transitions. [2024-11-09 15:32:31,872 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2024-11-09 15:32:31,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:31,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:31,875 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:31,875 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:31,875 INFO L745 eck$LassoCheckResult]: Stem: 272#$Ultimate##0 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); 242#L-1 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_~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_~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_~cond~0#1; 243#L113-1 [2024-11-09 15:32:31,875 INFO L747 eck$LassoCheckResult]: Loop: 243#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 289#L34 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; 290#L53 assume !(0 != main_~p1~0#1); 305#L53-2 assume !(0 != main_~p2~0#1); 254#L57-1 assume !(0 != main_~p3~0#1); 249#L61-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 250#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 268#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 269#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 297#L77-1 assume !(0 != main_~p1~0#1); 274#L83-1 assume !(0 != main_~p2~0#1); 257#L88-1 assume !(0 != main_~p3~0#1); 259#L93-1 assume !(0 != main_~p4~0#1); 260#L98-1 assume !(0 != main_~p5~0#1); 261#L103-1 assume !(0 != main_~p6~0#1); 308#L108-1 assume !(0 != main_~p7~0#1); 243#L113-1 [2024-11-09 15:32:31,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:31,877 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-09 15:32:31,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:31,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144405340] [2024-11-09 15:32:31,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:31,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:31,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:31,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:31,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:31,890 INFO L85 PathProgramCache]: Analyzing trace with hash 629589444, now seen corresponding path program 1 times [2024-11-09 15:32:31,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:31,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162525894] [2024-11-09 15:32:31,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:31,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:32:31,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:31,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162525894] [2024-11-09 15:32:31,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162525894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:31,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:31,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:31,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858114925] [2024-11-09 15:32:31,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:31,925 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:31,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:31,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:31,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:31,927 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2024-11-09 15:32:31,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:31,944 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2024-11-09 15:32:31,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 262 transitions. [2024-11-09 15:32:31,947 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2024-11-09 15:32:31,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 262 transitions. [2024-11-09 15:32:31,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2024-11-09 15:32:31,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2024-11-09 15:32:31,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 262 transitions. [2024-11-09 15:32:31,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:31,950 INFO L218 hiAutomatonCegarLoop]: Abstraction has 174 states and 262 transitions. [2024-11-09 15:32:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 262 transitions. [2024-11-09 15:32:31,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-09 15:32:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5057471264367817) internal successors, (262), 173 states have internal predecessors, (262), 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) [2024-11-09 15:32:31,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 262 transitions. [2024-11-09 15:32:31,966 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 262 transitions. [2024-11-09 15:32:31,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:31,969 INFO L425 stractBuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2024-11-09 15:32:31,969 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:32:31,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 262 transitions. [2024-11-09 15:32:31,971 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2024-11-09 15:32:31,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:31,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:31,972 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:31,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:31,976 INFO L745 eck$LassoCheckResult]: Stem: 540#$Ultimate##0 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); 512#L-1 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_~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_~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_~cond~0#1; 513#L113-1 [2024-11-09 15:32:31,976 INFO L747 eck$LassoCheckResult]: Loop: 513#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 574#L34 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; 569#L53 assume !(0 != main_~p1~0#1); 570#L53-2 assume !(0 != main_~p2~0#1); 626#L57-1 assume !(0 != main_~p3~0#1); 623#L61-1 assume !(0 != main_~p4~0#1); 619#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 614#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 610#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 606#L77-1 assume !(0 != main_~p1~0#1); 605#L83-1 assume !(0 != main_~p2~0#1); 604#L88-1 assume !(0 != main_~p3~0#1); 601#L93-1 assume !(0 != main_~p4~0#1); 599#L98-1 assume !(0 != main_~p5~0#1); 598#L103-1 assume !(0 != main_~p6~0#1); 596#L108-1 assume !(0 != main_~p7~0#1); 513#L113-1 [2024-11-09 15:32:31,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:31,978 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-09 15:32:31,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:31,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48931859] [2024-11-09 15:32:31,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:31,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:31,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:31,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:31,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:31,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1330654022, now seen corresponding path program 1 times [2024-11-09 15:32:31,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:31,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993875607] [2024-11-09 15:32:31,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:31,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:32:32,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:32,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993875607] [2024-11-09 15:32:32,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993875607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:32,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:32,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:32,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47551867] [2024-11-09 15:32:32,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:32,044 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:32,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:32,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:32,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:32,045 INFO L87 Difference]: Start difference. First operand 174 states and 262 transitions. cyclomatic complexity: 96 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2024-11-09 15:32:32,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:32,066 INFO L93 Difference]: Finished difference Result 338 states and 498 transitions. [2024-11-09 15:32:32,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 498 transitions. [2024-11-09 15:32:32,070 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2024-11-09 15:32:32,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 338 states and 498 transitions. [2024-11-09 15:32:32,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2024-11-09 15:32:32,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2024-11-09 15:32:32,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 498 transitions. [2024-11-09 15:32:32,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:32,075 INFO L218 hiAutomatonCegarLoop]: Abstraction has 338 states and 498 transitions. [2024-11-09 15:32:32,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 498 transitions. [2024-11-09 15:32:32,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2024-11-09 15:32:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 338 states have (on average 1.4733727810650887) internal successors, (498), 337 states have internal predecessors, (498), 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) [2024-11-09 15:32:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 498 transitions. [2024-11-09 15:32:32,099 INFO L240 hiAutomatonCegarLoop]: Abstraction has 338 states and 498 transitions. [2024-11-09 15:32:32,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:32,100 INFO L425 stractBuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2024-11-09 15:32:32,100 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:32:32,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 338 states and 498 transitions. [2024-11-09 15:32:32,102 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2024-11-09 15:32:32,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:32,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:32,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:32,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:32,104 INFO L745 eck$LassoCheckResult]: Stem: 1054#$Ultimate##0 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); 1030#L-1 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_~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_~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_~cond~0#1; 1031#L113-1 [2024-11-09 15:32:32,105 INFO L747 eck$LassoCheckResult]: Loop: 1031#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 1076#L34 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; 1077#L53 assume !(0 != main_~p1~0#1); 1130#L53-2 assume !(0 != main_~p2~0#1); 1127#L57-1 assume !(0 != main_~p3~0#1); 1124#L61-1 assume !(0 != main_~p4~0#1); 1122#L65-1 assume !(0 != main_~p5~0#1); 1120#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1117#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1113#L77-1 assume !(0 != main_~p1~0#1); 1109#L83-1 assume !(0 != main_~p2~0#1); 1107#L88-1 assume !(0 != main_~p3~0#1); 1103#L93-1 assume !(0 != main_~p4~0#1); 1100#L98-1 assume !(0 != main_~p5~0#1); 1101#L103-1 assume !(0 != main_~p6~0#1); 1096#L108-1 assume !(0 != main_~p7~0#1); 1031#L113-1 [2024-11-09 15:32:32,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:32,105 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-09 15:32:32,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:32,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137075800] [2024-11-09 15:32:32,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:32,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:32,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:32,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:32,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:32,129 INFO L85 PathProgramCache]: Analyzing trace with hash 937627012, now seen corresponding path program 1 times [2024-11-09 15:32:32,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:32,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109421377] [2024-11-09 15:32:32,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:32,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:32:32,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:32,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109421377] [2024-11-09 15:32:32,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109421377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:32,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:32,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:32,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997718269] [2024-11-09 15:32:32,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:32,167 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:32,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:32,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:32,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:32,168 INFO L87 Difference]: Start difference. First operand 338 states and 498 transitions. cyclomatic complexity: 176 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2024-11-09 15:32:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:32,188 INFO L93 Difference]: Finished difference Result 658 states and 946 transitions. [2024-11-09 15:32:32,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 658 states and 946 transitions. [2024-11-09 15:32:32,194 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2024-11-09 15:32:32,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 658 states to 658 states and 946 transitions. [2024-11-09 15:32:32,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 658 [2024-11-09 15:32:32,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 658 [2024-11-09 15:32:32,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 658 states and 946 transitions. [2024-11-09 15:32:32,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:32,204 INFO L218 hiAutomatonCegarLoop]: Abstraction has 658 states and 946 transitions. [2024-11-09 15:32:32,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states and 946 transitions. [2024-11-09 15:32:32,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2024-11-09 15:32:32,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 658 states have (on average 1.4376899696048633) internal successors, (946), 657 states have internal predecessors, (946), 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) [2024-11-09 15:32:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 946 transitions. [2024-11-09 15:32:32,233 INFO L240 hiAutomatonCegarLoop]: Abstraction has 658 states and 946 transitions. [2024-11-09 15:32:32,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:32,234 INFO L425 stractBuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2024-11-09 15:32:32,235 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:32:32,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 658 states and 946 transitions. [2024-11-09 15:32:32,239 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2024-11-09 15:32:32,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:32,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:32,240 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:32,240 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:32,240 INFO L745 eck$LassoCheckResult]: Stem: 2062#$Ultimate##0 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); 2032#L-1 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_~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_~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_~cond~0#1; 2033#L113-1 [2024-11-09 15:32:32,240 INFO L747 eck$LassoCheckResult]: Loop: 2033#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 2204#L34 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; 2184#L53 assume !(0 != main_~p1~0#1); 2177#L53-2 assume !(0 != main_~p2~0#1); 2179#L57-1 assume !(0 != main_~p3~0#1); 2355#L61-1 assume !(0 != main_~p4~0#1); 2351#L65-1 assume !(0 != main_~p5~0#1); 2348#L69-1 assume !(0 != main_~p6~0#1); 2346#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2344#L77-1 assume !(0 != main_~p1~0#1); 2342#L83-1 assume !(0 != main_~p2~0#1); 2340#L88-1 assume !(0 != main_~p3~0#1); 2337#L93-1 assume !(0 != main_~p4~0#1); 2336#L98-1 assume !(0 != main_~p5~0#1); 2333#L103-1 assume !(0 != main_~p6~0#1); 2334#L108-1 assume !(0 != main_~p7~0#1); 2033#L113-1 [2024-11-09 15:32:32,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:32,241 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-09 15:32:32,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:32,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101924172] [2024-11-09 15:32:32,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:32,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:32,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:32,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:32,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:32,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1617685382, now seen corresponding path program 1 times [2024-11-09 15:32:32,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:32,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653680202] [2024-11-09 15:32:32,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:32,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:32:32,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:32,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653680202] [2024-11-09 15:32:32,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653680202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:32,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:32,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:32:32,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060727380] [2024-11-09 15:32:32,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:32,286 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:32,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:32,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:32,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:32,288 INFO L87 Difference]: Start difference. First operand 658 states and 946 transitions. cyclomatic complexity: 320 Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2024-11-09 15:32:32,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:32,313 INFO L93 Difference]: Finished difference Result 1282 states and 1794 transitions. [2024-11-09 15:32:32,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1282 states and 1794 transitions. [2024-11-09 15:32:32,324 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2024-11-09 15:32:32,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1282 states to 1282 states and 1794 transitions. [2024-11-09 15:32:32,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1282 [2024-11-09 15:32:32,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1282 [2024-11-09 15:32:32,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1282 states and 1794 transitions. [2024-11-09 15:32:32,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:32,332 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2024-11-09 15:32:32,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states and 1794 transitions. [2024-11-09 15:32:32,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2024-11-09 15:32:32,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1282 states have (on average 1.3993759750390016) internal successors, (1794), 1281 states have internal predecessors, (1794), 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) [2024-11-09 15:32:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1794 transitions. [2024-11-09 15:32:32,354 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2024-11-09 15:32:32,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:32,356 INFO L425 stractBuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2024-11-09 15:32:32,356 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:32:32,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1282 states and 1794 transitions. [2024-11-09 15:32:32,362 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2024-11-09 15:32:32,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:32,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:32,364 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:32,364 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:32,364 INFO L745 eck$LassoCheckResult]: Stem: 4013#$Ultimate##0 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); 3978#L-1 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_~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_~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_~cond~0#1; 3979#L113-1 [2024-11-09 15:32:32,364 INFO L747 eck$LassoCheckResult]: Loop: 3979#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 4219#L34 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; 4217#L53 assume !(0 != main_~p1~0#1); 4212#L53-2 assume !(0 != main_~p2~0#1); 4206#L57-1 assume !(0 != main_~p3~0#1); 4201#L61-1 assume !(0 != main_~p4~0#1); 4202#L65-1 assume !(0 != main_~p5~0#1); 4249#L69-1 assume !(0 != main_~p6~0#1); 4247#L73-1 assume !(0 != main_~p7~0#1); 4243#L77-1 assume !(0 != main_~p1~0#1); 4235#L83-1 assume !(0 != main_~p2~0#1); 4234#L88-1 assume !(0 != main_~p3~0#1); 4081#L93-1 assume !(0 != main_~p4~0#1); 4082#L98-1 assume !(0 != main_~p5~0#1); 4226#L103-1 assume !(0 != main_~p6~0#1); 4223#L108-1 assume !(0 != main_~p7~0#1); 3979#L113-1 [2024-11-09 15:32:32,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:32,365 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-09 15:32:32,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:32,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185943027] [2024-11-09 15:32:32,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:32,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:32,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:32,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:32,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:32,379 INFO L85 PathProgramCache]: Analyzing trace with hash 808338756, now seen corresponding path program 1 times [2024-11-09 15:32:32,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:32,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171061231] [2024-11-09 15:32:32,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:32,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:32,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:32,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:32,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:32,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1317176582, now seen corresponding path program 1 times [2024-11-09 15:32:32,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:32,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306660776] [2024-11-09 15:32:32,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:32,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:32,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:32,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:32,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:32,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:32:32 BoogieIcfgContainer [2024-11-09 15:32:32,790 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:32:32,792 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:32:32,792 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:32:32,792 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:32:32,793 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:32:31" (3/4) ... [2024-11-09 15:32:32,796 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-09 15:32:32,843 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 15:32:32,846 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:32:32,846 INFO L158 Benchmark]: Toolchain (without parser) took 2223.98ms. Allocated memory was 176.2MB in the beginning and 230.7MB in the end (delta: 54.5MB). Free memory was 120.2MB in the beginning and 99.7MB in the end (delta: 20.5MB). Peak memory consumption was 77.1MB. Max. memory is 16.1GB. [2024-11-09 15:32:32,847 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:32:32,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.89ms. Allocated memory is still 176.2MB. Free memory was 120.2MB in the beginning and 106.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 15:32:32,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.56ms. Allocated memory is still 176.2MB. Free memory was 106.6MB in the beginning and 104.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:32:32,848 INFO L158 Benchmark]: Boogie Preprocessor took 30.98ms. Allocated memory is still 176.2MB. Free memory was 104.9MB in the beginning and 103.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:32:32,849 INFO L158 Benchmark]: RCFGBuilder took 344.53ms. Allocated memory is still 176.2MB. Free memory was 103.4MB in the beginning and 90.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 15:32:32,850 INFO L158 Benchmark]: BuchiAutomizer took 1491.46ms. Allocated memory was 176.2MB in the beginning and 230.7MB in the end (delta: 54.5MB). Free memory was 90.9MB in the beginning and 102.4MB in the end (delta: -11.5MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2024-11-09 15:32:32,850 INFO L158 Benchmark]: Witness Printer took 53.92ms. Allocated memory is still 230.7MB. Free memory was 102.4MB in the beginning and 99.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 15:32:32,854 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.20ms. Allocated memory is still 176.2MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.89ms. Allocated memory is still 176.2MB. Free memory was 120.2MB in the beginning and 106.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.56ms. Allocated memory is still 176.2MB. Free memory was 106.6MB in the beginning and 104.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.98ms. Allocated memory is still 176.2MB. Free memory was 104.9MB in the beginning and 103.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 344.53ms. Allocated memory is still 176.2MB. Free memory was 103.4MB in the beginning and 90.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 1491.46ms. Allocated memory was 176.2MB in the beginning and 230.7MB in the end (delta: 54.5MB). Free memory was 90.9MB in the beginning and 102.4MB in the end (delta: -11.5MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. * Witness Printer took 53.92ms. Allocated memory is still 230.7MB. Free memory was 102.4MB in the beginning and 99.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. 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 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 1282 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s 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, 177 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 177 mSDsluCounter, 556 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 207 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 349 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI6 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: 32]: 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; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 32]: 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; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 15:32:32,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)