./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.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 a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 01:00:16,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 01:00:16,764 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-15 01:00:16,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 01:00:16,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 01:00:16,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 01:00:16,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 01:00:16,792 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 01:00:16,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 01:00:16,793 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 01:00:16,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 01:00:16,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 01:00:16,794 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 01:00:16,794 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 01:00:16,794 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 01:00:16,794 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 01:00:16,795 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 01:00:16,795 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 01:00:16,795 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 01:00:16,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 01:00:16,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 01:00:16,796 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 01:00:16,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 01:00:16,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 01:00:16,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 01:00:16,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 01:00:16,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 01:00:16,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 01:00:16,798 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 01:00:16,798 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 01:00:16,798 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 01:00:16,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 01:00:16,799 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 01:00:16,799 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 01:00:16,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 01:00:16,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 01:00:16,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 01:00:16,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 01:00:16,800 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 01:00:16,801 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 -> a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 [2024-10-15 01:00:16,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 01:00:17,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 01:00:17,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 01:00:17,031 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 01:00:17,031 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 01:00:17,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2024-10-15 01:00:18,494 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 01:00:18,855 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 01:00:18,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2024-10-15 01:00:18,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/413282a41/0566bbc129c340a58aa72ec4f5a74855/FLAGb9814855e [2024-10-15 01:00:19,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/413282a41/0566bbc129c340a58aa72ec4f5a74855 [2024-10-15 01:00:19,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 01:00:19,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 01:00:19,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 01:00:19,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 01:00:19,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 01:00:19,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:00:19" (1/1) ... [2024-10-15 01:00:19,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5504576e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:00:19, skipping insertion in model container [2024-10-15 01:00:19,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:00:19" (1/1) ... [2024-10-15 01:00:19,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 01:00:19,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 01:00:19,440 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 01:00:19,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 01:00:19,519 INFO L204 MainTranslator]: Completed translation [2024-10-15 01:00:19,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:00:19 WrapperNode [2024-10-15 01:00:19,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 01:00:19,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 01:00:19,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 01:00:19,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 01:00:19,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:00:19" (1/1) ... [2024-10-15 01:00:19,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:00:19" (1/1) ... [2024-10-15 01:00:19,569 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 361 [2024-10-15 01:00:19,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 01:00:19,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 01:00:19,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 01:00:19,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 01:00:19,584 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:00:19" (1/1) ... [2024-10-15 01:00:19,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:00:19" (1/1) ... [2024-10-15 01:00:19,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:00:19" (1/1) ... [2024-10-15 01:00:19,616 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-10-15 01:00:19,617 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:00:19" (1/1) ... [2024-10-15 01:00:19,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:00:19" (1/1) ... [2024-10-15 01:00:19,623 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:00:19" (1/1) ... [2024-10-15 01:00:19,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:00:19" (1/1) ... [2024-10-15 01:00:19,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:00:19" (1/1) ... [2024-10-15 01:00:19,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:00:19" (1/1) ... [2024-10-15 01:00:19,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 01:00:19,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 01:00:19,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 01:00:19,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 01:00:19,664 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:00:19" (1/1) ... [2024-10-15 01:00:19,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:19,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:19,712 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-10-15 01:00:19,719 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-10-15 01:00:19,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 01:00:19,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 01:00:19,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 01:00:19,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 01:00:19,887 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 01:00:19,889 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 01:00:20,255 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-15 01:00:20,255 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 01:00:20,267 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 01:00:20,267 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-15 01:00:20,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:00:20 BoogieIcfgContainer [2024-10-15 01:00:20,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 01:00:20,269 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 01:00:20,269 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 01:00:20,272 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 01:00:20,273 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 01:00:20,273 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 01:00:19" (1/3) ... [2024-10-15 01:00:20,274 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c4d4d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 01:00:20, skipping insertion in model container [2024-10-15 01:00:20,274 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 01:00:20,274 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:00:19" (2/3) ... [2024-10-15 01:00:20,274 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c4d4d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 01:00:20, skipping insertion in model container [2024-10-15 01:00:20,274 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 01:00:20,274 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:00:20" (3/3) ... [2024-10-15 01:00:20,275 INFO L332 chiAutomizerObserver]: Analyzing ICFG toy2.cil.c [2024-10-15 01:00:20,318 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 01:00:20,318 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 01:00:20,319 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 01:00:20,319 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 01:00:20,319 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 01:00:20,319 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 01:00:20,319 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 01:00:20,319 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 01:00:20,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.823076923076923) internal successors, (237), 130 states have internal predecessors, (237), 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-10-15 01:00:20,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2024-10-15 01:00:20,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:00:20,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:00:20,348 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:20,348 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:20,349 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 01:00:20,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.823076923076923) internal successors, (237), 130 states have internal predecessors, (237), 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-10-15 01:00:20,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2024-10-15 01:00:20,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:00:20,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:00:20,355 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:20,356 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:20,362 INFO L745 eck$LassoCheckResult]: Stem: 32#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 42#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 113#L404true assume !(1 == ~c_req_up~0); 61#L404-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 22#L415-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 50#L420-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 84#L425-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 39#L430-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 125#L435-1true assume !(0 == ~e_f~0); 26#L440-1true assume !(0 == ~e_g~0); 44#L445-1true assume !(0 == ~e_e~0); 47#L450-1true assume !(0 == ~e_c~0); 21#L455-1true assume !(0 == ~e_wl~0); 76#L460-1true assume !(1 == ~wl_pc~0); 96#$Ultimate##44true assume !(2 == ~wl_pc~0); 121#L473true assume !(1 == ~c1_pc~0); 103#L483true assume !(1 == ~c2_pc~0); 115#L492true assume !(1 == ~wb_pc~0); 52#L501true assume !(1 == ~e_c~0); 31#L510-1true assume !(1 == ~e_e~0); 23#L515-1true assume !(1 == ~e_f~0); 14#L520-1true assume !(1 == ~e_g~0); 45#L525-1true assume !(1 == ~e_c~0); 82#L530-1true assume !(1 == ~e_wl~0); 65#L672-1true [2024-10-15 01:00:20,363 INFO L747 eck$LassoCheckResult]: Loop: 65#L672-1true assume !false; 6#L542true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 128#L377true assume !true; 86#eval_returnLabel#1true havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 64#L548true assume !(1 == ~c_req_up~0); 9#L548-2true start_simulation_~kernel_st~0#1 := 3; 25#L560true assume 0 == ~e_f~0;~e_f~0 := 1; 97#L560-2true assume 0 == ~e_g~0;~e_g~0 := 1; 18#L565-1true assume 0 == ~e_e~0;~e_e~0 := 1; 129#L570-1true assume 0 == ~e_c~0;~e_c~0 := 1; 35#L575-1true assume !(0 == ~e_wl~0); 122#L580-1true assume !(1 == ~wl_pc~0); 75#$Ultimate##251true assume !(2 == ~wl_pc~0); 80#L593true assume !(1 == ~c1_pc~0); 116#L603true assume !(1 == ~c2_pc~0); 3#L612true assume !(1 == ~wb_pc~0); 60#L621true assume 1 == ~e_c~0;~r_st~0 := 0; 58#L630-1true assume 1 == ~e_e~0;~e_e~0 := 2; 131#L635-1true assume 1 == ~e_f~0;~e_f~0 := 2; 130#L640-1true assume 1 == ~e_g~0;~e_g~0 := 2; 111#L645-1true assume 1 == ~e_c~0;~e_c~0 := 2; 11#L650-1true assume !(1 == ~e_wl~0); 40#L655-1true assume 0 == ~wl_st~0; 65#L672-1true [2024-10-15 01:00:20,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:20,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2024-10-15 01:00:20,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:20,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022423458] [2024-10-15 01:00:20,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:20,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:20,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:00:20,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022423458] [2024-10-15 01:00:20,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022423458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:00:20,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:00:20,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 01:00:20,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316604629] [2024-10-15 01:00:20,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:00:20,588 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 01:00:20,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:20,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1858065656, now seen corresponding path program 1 times [2024-10-15 01:00:20,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:20,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130442426] [2024-10-15 01:00:20,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:20,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:20,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:00:20,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130442426] [2024-10-15 01:00:20,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130442426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:00:20,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:00:20,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 01:00:20,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420303870] [2024-10-15 01:00:20,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:00:20,622 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 01:00:20,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:00:20,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 01:00:20,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 01:00:20,660 INFO L87 Difference]: Start difference. First operand has 131 states, 130 states have (on average 1.823076923076923) internal successors, (237), 130 states have internal predecessors, (237), 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 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-10-15 01:00:20,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:00:20,673 INFO L93 Difference]: Finished difference Result 129 states and 222 transitions. [2024-10-15 01:00:20,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 222 transitions. [2024-10-15 01:00:20,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-15 01:00:20,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 124 states and 217 transitions. [2024-10-15 01:00:20,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2024-10-15 01:00:20,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2024-10-15 01:00:20,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 217 transitions. [2024-10-15 01:00:20,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 01:00:20,684 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 217 transitions. [2024-10-15 01:00:20,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 217 transitions. [2024-10-15 01:00:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-15 01:00:20,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.75) internal successors, (217), 123 states have internal predecessors, (217), 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-10-15 01:00:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 217 transitions. [2024-10-15 01:00:20,727 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 217 transitions. [2024-10-15 01:00:20,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 01:00:20,735 INFO L425 stractBuchiCegarLoop]: Abstraction has 124 states and 217 transitions. [2024-10-15 01:00:20,735 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 01:00:20,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 217 transitions. [2024-10-15 01:00:20,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-15 01:00:20,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:00:20,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:00:20,738 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:20,738 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:20,738 INFO L745 eck$LassoCheckResult]: Stem: 325#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 326#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 340#L404 assume !(1 == ~c_req_up~0); 363#L404-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 309#L415-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 310#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 351#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 337#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 338#L435-1 assume !(0 == ~e_f~0); 315#L440-1 assume !(0 == ~e_g~0); 316#L445-1 assume !(0 == ~e_e~0); 343#L450-1 assume !(0 == ~e_c~0); 307#L455-1 assume !(0 == ~e_wl~0); 308#L460-1 assume !(1 == ~wl_pc~0); 376#$Ultimate##44 assume !(2 == ~wl_pc~0); 354#L473 assume !(1 == ~c1_pc~0); 386#L483 assume !(1 == ~c2_pc~0); 297#L492 assume !(1 == ~wb_pc~0); 342#L501 assume !(1 == ~e_c~0); 324#L510-1 assume !(1 == ~e_e~0); 311#L515-1 assume !(1 == ~e_f~0); 294#L520-1 assume !(1 == ~e_g~0); 295#L525-1 assume !(1 == ~e_c~0); 344#L530-1 assume !(1 == ~e_wl~0); 292#L672-1 [2024-10-15 01:00:20,738 INFO L747 eck$LassoCheckResult]: Loop: 292#L672-1 assume !false; 278#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 279#L377 assume !false; 275#L295 assume !(0 == ~wl_st~0); 277#L299 assume !(0 == ~c1_st~0); 336#L302 assume !(0 == ~c2_st~0); 366#L305 assume !(0 == ~wb_st~0); 286#L308 assume !(0 == ~r_st~0); 287#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 365#L548 assume !(1 == ~c_req_up~0); 284#L548-2 start_simulation_~kernel_st~0#1 := 3; 285#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 314#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 304#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 305#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 332#L575-1 assume !(0 == ~e_wl~0); 333#L580-1 assume 1 == ~wl_pc~0; 385#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 375#L593 assume !(1 == ~c1_pc~0); 350#L603 assume !(1 == ~c2_pc~0); 269#L612 assume !(1 == ~wb_pc~0); 271#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 359#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 360#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 392#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 390#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 288#L650-1 assume !(1 == ~e_wl~0); 289#L655-1 assume 0 == ~wl_st~0; 292#L672-1 [2024-10-15 01:00:20,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:20,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2024-10-15 01:00:20,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:20,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168670681] [2024-10-15 01:00:20,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:20,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:20,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:00:20,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168670681] [2024-10-15 01:00:20,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168670681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:00:20,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:00:20,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 01:00:20,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852623613] [2024-10-15 01:00:20,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:00:20,865 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 01:00:20,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:20,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233037, now seen corresponding path program 1 times [2024-10-15 01:00:20,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:20,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047942830] [2024-10-15 01:00:20,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:20,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:20,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:00:20,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047942830] [2024-10-15 01:00:20,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047942830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:00:20,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:00:20,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 01:00:20,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663152111] [2024-10-15 01:00:20,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:00:20,914 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 01:00:20,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:00:20,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 01:00:20,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 01:00:20,915 INFO L87 Difference]: Start difference. First operand 124 states and 217 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-10-15 01:00:20,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:00:20,936 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2024-10-15 01:00:20,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 216 transitions. [2024-10-15 01:00:20,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-15 01:00:20,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 216 transitions. [2024-10-15 01:00:20,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2024-10-15 01:00:20,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2024-10-15 01:00:20,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 216 transitions. [2024-10-15 01:00:20,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 01:00:20,942 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 216 transitions. [2024-10-15 01:00:20,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 216 transitions. [2024-10-15 01:00:20,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-15 01:00:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7419354838709677) internal successors, (216), 123 states have internal predecessors, (216), 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-10-15 01:00:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 216 transitions. [2024-10-15 01:00:20,953 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 216 transitions. [2024-10-15 01:00:20,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 01:00:20,954 INFO L425 stractBuchiCegarLoop]: Abstraction has 124 states and 216 transitions. [2024-10-15 01:00:20,955 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 01:00:20,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 216 transitions. [2024-10-15 01:00:20,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-15 01:00:20,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:00:20,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:00:20,958 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:20,958 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:20,959 INFO L745 eck$LassoCheckResult]: Stem: 580#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 581#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 595#L404 assume !(1 == ~c_req_up~0); 618#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 564#L415-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 565#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 606#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 592#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 593#L435-1 assume !(0 == ~e_f~0); 570#L440-1 assume !(0 == ~e_g~0); 571#L445-1 assume !(0 == ~e_e~0); 598#L450-1 assume !(0 == ~e_c~0); 562#L455-1 assume !(0 == ~e_wl~0); 563#L460-1 assume !(1 == ~wl_pc~0); 631#$Ultimate##44 assume !(2 == ~wl_pc~0); 609#L473 assume !(1 == ~c1_pc~0); 641#L483 assume !(1 == ~c2_pc~0); 552#L492 assume !(1 == ~wb_pc~0); 597#L501 assume !(1 == ~e_c~0); 579#L510-1 assume !(1 == ~e_e~0); 566#L515-1 assume !(1 == ~e_f~0); 549#L520-1 assume !(1 == ~e_g~0); 550#L525-1 assume !(1 == ~e_c~0); 599#L530-1 assume !(1 == ~e_wl~0); 547#L672-1 [2024-10-15 01:00:20,959 INFO L747 eck$LassoCheckResult]: Loop: 547#L672-1 assume !false; 533#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 534#L377 assume !false; 530#L295 assume !(0 == ~wl_st~0); 532#L299 assume !(0 == ~c1_st~0); 591#L302 assume !(0 == ~c2_st~0); 621#L305 assume !(0 == ~wb_st~0); 541#L308 assume !(0 == ~r_st~0); 542#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 620#L548 assume !(1 == ~c_req_up~0); 539#L548-2 start_simulation_~kernel_st~0#1 := 3; 540#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 569#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 559#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 560#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 587#L575-1 assume !(0 == ~e_wl~0); 588#L580-1 assume 1 == ~wl_pc~0; 640#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 630#L593 assume !(1 == ~c1_pc~0); 605#L603 assume !(1 == ~c2_pc~0); 524#L612 assume !(1 == ~wb_pc~0); 526#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 614#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 615#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 647#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 645#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 543#L650-1 assume !(1 == ~e_wl~0); 544#L655-1 assume 0 == ~wl_st~0; 547#L672-1 [2024-10-15 01:00:20,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:20,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2024-10-15 01:00:20,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:20,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722310870] [2024-10-15 01:00:20,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:20,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:21,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:00:21,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722310870] [2024-10-15 01:00:21,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722310870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:00:21,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:00:21,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 01:00:21,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496628657] [2024-10-15 01:00:21,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:00:21,027 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 01:00:21,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:21,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233037, now seen corresponding path program 2 times [2024-10-15 01:00:21,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:21,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168095855] [2024-10-15 01:00:21,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:21,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:21,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:21,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:00:21,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168095855] [2024-10-15 01:00:21,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168095855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:00:21,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:00:21,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 01:00:21,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866651368] [2024-10-15 01:00:21,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:00:21,053 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 01:00:21,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:00:21,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 01:00:21,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 01:00:21,053 INFO L87 Difference]: Start difference. First operand 124 states and 216 transitions. cyclomatic complexity: 93 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-10-15 01:00:21,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:00:21,072 INFO L93 Difference]: Finished difference Result 124 states and 215 transitions. [2024-10-15 01:00:21,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 215 transitions. [2024-10-15 01:00:21,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-15 01:00:21,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 215 transitions. [2024-10-15 01:00:21,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2024-10-15 01:00:21,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2024-10-15 01:00:21,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 215 transitions. [2024-10-15 01:00:21,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 01:00:21,079 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 215 transitions. [2024-10-15 01:00:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 215 transitions. [2024-10-15 01:00:21,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-15 01:00:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 123 states have internal predecessors, (215), 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-10-15 01:00:21,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 215 transitions. [2024-10-15 01:00:21,086 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 215 transitions. [2024-10-15 01:00:21,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 01:00:21,087 INFO L425 stractBuchiCegarLoop]: Abstraction has 124 states and 215 transitions. [2024-10-15 01:00:21,090 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 01:00:21,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 215 transitions. [2024-10-15 01:00:21,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-15 01:00:21,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:00:21,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:00:21,091 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:21,091 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:21,091 INFO L745 eck$LassoCheckResult]: Stem: 835#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 836#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 850#L404 assume !(1 == ~c_req_up~0); 873#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 819#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 820#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 861#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 847#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 848#L435-1 assume !(0 == ~e_f~0); 825#L440-1 assume !(0 == ~e_g~0); 826#L445-1 assume !(0 == ~e_e~0); 853#L450-1 assume !(0 == ~e_c~0); 817#L455-1 assume !(0 == ~e_wl~0); 818#L460-1 assume !(1 == ~wl_pc~0); 886#$Ultimate##44 assume !(2 == ~wl_pc~0); 864#L473 assume !(1 == ~c1_pc~0); 896#L483 assume !(1 == ~c2_pc~0); 807#L492 assume !(1 == ~wb_pc~0); 852#L501 assume !(1 == ~e_c~0); 834#L510-1 assume !(1 == ~e_e~0); 821#L515-1 assume !(1 == ~e_f~0); 804#L520-1 assume !(1 == ~e_g~0); 805#L525-1 assume !(1 == ~e_c~0); 854#L530-1 assume !(1 == ~e_wl~0); 802#L672-1 [2024-10-15 01:00:21,092 INFO L747 eck$LassoCheckResult]: Loop: 802#L672-1 assume !false; 788#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 789#L377 assume !false; 785#L295 assume !(0 == ~wl_st~0); 787#L299 assume !(0 == ~c1_st~0); 846#L302 assume !(0 == ~c2_st~0); 876#L305 assume !(0 == ~wb_st~0); 796#L308 assume !(0 == ~r_st~0); 797#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 875#L548 assume !(1 == ~c_req_up~0); 794#L548-2 start_simulation_~kernel_st~0#1 := 3; 795#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 824#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 814#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 815#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 842#L575-1 assume !(0 == ~e_wl~0); 843#L580-1 assume !(1 == ~wl_pc~0); 883#$Ultimate##251 assume !(2 == ~wl_pc~0); 885#L593 assume !(1 == ~c1_pc~0); 860#L603 assume !(1 == ~c2_pc~0); 779#L612 assume !(1 == ~wb_pc~0); 781#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 869#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 870#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 902#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 900#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 798#L650-1 assume !(1 == ~e_wl~0); 799#L655-1 assume 0 == ~wl_st~0; 802#L672-1 [2024-10-15 01:00:21,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:21,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2024-10-15 01:00:21,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:21,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131698490] [2024-10-15 01:00:21,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:21,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:21,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:00:21,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131698490] [2024-10-15 01:00:21,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131698490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:00:21,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:00:21,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 01:00:21,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115491361] [2024-10-15 01:00:21,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:00:21,132 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 01:00:21,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1401973316, now seen corresponding path program 1 times [2024-10-15 01:00:21,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:21,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533149695] [2024-10-15 01:00:21,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:21,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:21,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:00:21,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533149695] [2024-10-15 01:00:21,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533149695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:00:21,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:00:21,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 01:00:21,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578961134] [2024-10-15 01:00:21,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:00:21,152 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 01:00:21,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:00:21,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 01:00:21,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 01:00:21,153 INFO L87 Difference]: Start difference. First operand 124 states and 215 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-10-15 01:00:21,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:00:21,161 INFO L93 Difference]: Finished difference Result 124 states and 214 transitions. [2024-10-15 01:00:21,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 214 transitions. [2024-10-15 01:00:21,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-15 01:00:21,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 214 transitions. [2024-10-15 01:00:21,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2024-10-15 01:00:21,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2024-10-15 01:00:21,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 214 transitions. [2024-10-15 01:00:21,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 01:00:21,164 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 214 transitions. [2024-10-15 01:00:21,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 214 transitions. [2024-10-15 01:00:21,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-15 01:00:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7258064516129032) internal successors, (214), 123 states have internal predecessors, (214), 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-10-15 01:00:21,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 214 transitions. [2024-10-15 01:00:21,168 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 214 transitions. [2024-10-15 01:00:21,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 01:00:21,169 INFO L425 stractBuchiCegarLoop]: Abstraction has 124 states and 214 transitions. [2024-10-15 01:00:21,169 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 01:00:21,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 214 transitions. [2024-10-15 01:00:21,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-15 01:00:21,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:00:21,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:00:21,171 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:21,171 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:21,171 INFO L745 eck$LassoCheckResult]: Stem: 1090#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1091#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1105#L404 assume !(1 == ~c_req_up~0); 1128#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1074#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1075#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1116#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1102#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1103#L435-1 assume !(0 == ~e_f~0); 1080#L440-1 assume !(0 == ~e_g~0); 1081#L445-1 assume !(0 == ~e_e~0); 1108#L450-1 assume !(0 == ~e_c~0); 1072#L455-1 assume !(0 == ~e_wl~0); 1073#L460-1 assume !(1 == ~wl_pc~0); 1141#$Ultimate##44 assume !(2 == ~wl_pc~0); 1119#L473 assume !(1 == ~c1_pc~0); 1151#L483 assume !(1 == ~c2_pc~0); 1062#L492 assume !(1 == ~wb_pc~0); 1107#L501 assume !(1 == ~e_c~0); 1089#L510-1 assume !(1 == ~e_e~0); 1076#L515-1 assume !(1 == ~e_f~0); 1059#L520-1 assume !(1 == ~e_g~0); 1060#L525-1 assume !(1 == ~e_c~0); 1109#L530-1 assume !(1 == ~e_wl~0); 1057#L672-1 [2024-10-15 01:00:21,172 INFO L747 eck$LassoCheckResult]: Loop: 1057#L672-1 assume !false; 1043#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1044#L377 assume !false; 1040#L295 assume !(0 == ~wl_st~0); 1042#L299 assume !(0 == ~c1_st~0); 1101#L302 assume !(0 == ~c2_st~0); 1131#L305 assume !(0 == ~wb_st~0); 1051#L308 assume !(0 == ~r_st~0); 1052#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1130#L548 assume !(1 == ~c_req_up~0); 1049#L548-2 start_simulation_~kernel_st~0#1 := 3; 1050#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1079#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1069#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1070#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1097#L575-1 assume !(0 == ~e_wl~0); 1098#L580-1 assume !(1 == ~wl_pc~0); 1138#$Ultimate##251 assume !(2 == ~wl_pc~0); 1140#L593 assume !(1 == ~c1_pc~0); 1115#L603 assume !(1 == ~c2_pc~0); 1034#L612 assume !(1 == ~wb_pc~0); 1036#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 1124#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1125#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1157#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1155#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1053#L650-1 assume !(1 == ~e_wl~0); 1054#L655-1 assume 0 == ~wl_st~0; 1057#L672-1 [2024-10-15 01:00:21,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:21,172 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2024-10-15 01:00:21,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:21,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44735644] [2024-10-15 01:00:21,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:21,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:21,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:00:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:21,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 01:00:21,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:21,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1401973316, now seen corresponding path program 2 times [2024-10-15 01:00:21,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:21,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225250012] [2024-10-15 01:00:21,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:21,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:21,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:21,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:00:21,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225250012] [2024-10-15 01:00:21,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225250012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:00:21,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:00:21,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 01:00:21,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334348417] [2024-10-15 01:00:21,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:00:21,237 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 01:00:21,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:00:21,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 01:00:21,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 01:00:21,238 INFO L87 Difference]: Start difference. First operand 124 states and 214 transitions. cyclomatic complexity: 91 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-10-15 01:00:21,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:00:21,278 INFO L93 Difference]: Finished difference Result 180 states and 306 transitions. [2024-10-15 01:00:21,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 306 transitions. [2024-10-15 01:00:21,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 149 [2024-10-15 01:00:21,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 180 states and 306 transitions. [2024-10-15 01:00:21,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2024-10-15 01:00:21,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2024-10-15 01:00:21,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 306 transitions. [2024-10-15 01:00:21,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 01:00:21,286 INFO L218 hiAutomatonCegarLoop]: Abstraction has 180 states and 306 transitions. [2024-10-15 01:00:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 306 transitions. [2024-10-15 01:00:21,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-10-15 01:00:21,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 180 states have (on average 1.7) internal successors, (306), 179 states have internal predecessors, (306), 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-10-15 01:00:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 306 transitions. [2024-10-15 01:00:21,295 INFO L240 hiAutomatonCegarLoop]: Abstraction has 180 states and 306 transitions. [2024-10-15 01:00:21,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 01:00:21,296 INFO L425 stractBuchiCegarLoop]: Abstraction has 180 states and 306 transitions. [2024-10-15 01:00:21,296 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 01:00:21,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 180 states and 306 transitions. [2024-10-15 01:00:21,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 149 [2024-10-15 01:00:21,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:00:21,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:00:21,298 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:21,301 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:21,301 INFO L745 eck$LassoCheckResult]: Stem: 1400#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1401#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1415#L404 assume !(1 == ~c_req_up~0); 1438#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1385#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1386#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1426#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1412#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1413#L435-1 assume !(0 == ~e_f~0); 1391#L440-1 assume !(0 == ~e_g~0); 1392#L445-1 assume !(0 == ~e_e~0); 1418#L450-1 assume !(0 == ~e_c~0); 1383#L455-1 assume !(0 == ~e_wl~0); 1384#L460-1 assume !(1 == ~wl_pc~0); 1453#$Ultimate##44 assume !(2 == ~wl_pc~0); 1429#L473 assume !(1 == ~c1_pc~0); 1465#L483 assume !(1 == ~c2_pc~0); 1373#L492 assume !(1 == ~wb_pc~0); 1417#L501 assume !(1 == ~e_c~0); 1399#L510-1 assume !(1 == ~e_e~0); 1387#L515-1 assume !(1 == ~e_f~0); 1370#L520-1 assume !(1 == ~e_g~0); 1371#L525-1 assume !(1 == ~e_c~0); 1419#L530-1 assume !(1 == ~e_wl~0); 1457#L672-1 [2024-10-15 01:00:21,301 INFO L747 eck$LassoCheckResult]: Loop: 1457#L672-1 assume !false; 1475#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1474#L377 assume !false; 1473#L295 assume !(0 == ~wl_st~0); 1351#L299 assume !(0 == ~c1_st~0); 1411#L302 assume !(0 == ~c2_st~0); 1441#L305 assume !(0 == ~wb_st~0); 1361#L308 assume !(0 == ~r_st~0); 1363#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1440#L548 assume !(1 == ~c_req_up~0); 1359#L548-2 start_simulation_~kernel_st~0#1 := 3; 1360#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1390#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1374#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1375#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1403#L575-1 assume !(0 == ~e_wl~0); 1404#L580-1 assume 1 == ~wl_pc~0; 1464#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1462#L593 assume !(1 == ~c1_pc~0); 1521#L603 assume !(1 == ~c2_pc~0); 1520#L612 assume !(1 == ~wb_pc~0); 1518#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 1517#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1516#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1515#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1514#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1513#L650-1 assume !(1 == ~e_wl~0); 1511#L655-1 assume 0 == ~wl_st~0; 1457#L672-1 [2024-10-15 01:00:21,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:21,302 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 2 times [2024-10-15 01:00:21,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:21,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479948422] [2024-10-15 01:00:21,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:21,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:21,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:00:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:21,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 01:00:21,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:21,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233037, now seen corresponding path program 3 times [2024-10-15 01:00:21,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:21,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555289359] [2024-10-15 01:00:21,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:21,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:21,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:00:21,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555289359] [2024-10-15 01:00:21,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555289359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:00:21,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:00:21,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 01:00:21,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183093756] [2024-10-15 01:00:21,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:00:21,354 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 01:00:21,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:00:21,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 01:00:21,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 01:00:21,355 INFO L87 Difference]: Start difference. First operand 180 states and 306 transitions. cyclomatic complexity: 127 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-10-15 01:00:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:00:21,403 INFO L93 Difference]: Finished difference Result 335 states and 566 transitions. [2024-10-15 01:00:21,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 335 states and 566 transitions. [2024-10-15 01:00:21,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 288 [2024-10-15 01:00:21,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 335 states to 335 states and 566 transitions. [2024-10-15 01:00:21,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 335 [2024-10-15 01:00:21,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 335 [2024-10-15 01:00:21,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 335 states and 566 transitions. [2024-10-15 01:00:21,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 01:00:21,410 INFO L218 hiAutomatonCegarLoop]: Abstraction has 335 states and 566 transitions. [2024-10-15 01:00:21,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states and 566 transitions. [2024-10-15 01:00:21,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2024-10-15 01:00:21,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 333 states have (on average 1.6936936936936937) internal successors, (564), 332 states have internal predecessors, (564), 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-10-15 01:00:21,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 564 transitions. [2024-10-15 01:00:21,423 INFO L240 hiAutomatonCegarLoop]: Abstraction has 333 states and 564 transitions. [2024-10-15 01:00:21,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 01:00:21,424 INFO L425 stractBuchiCegarLoop]: Abstraction has 333 states and 564 transitions. [2024-10-15 01:00:21,424 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 01:00:21,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 333 states and 564 transitions. [2024-10-15 01:00:21,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 286 [2024-10-15 01:00:21,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:00:21,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:00:21,426 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:21,426 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:21,427 INFO L745 eck$LassoCheckResult]: Stem: 1925#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1926#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1943#L404 assume !(1 == ~c_req_up~0); 1965#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1907#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1908#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1952#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1938#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1939#L435-1 assume !(0 == ~e_f~0); 1913#L440-1 assume !(0 == ~e_g~0); 1914#L445-1 assume !(0 == ~e_e~0); 1944#L450-1 assume !(0 == ~e_c~0); 1904#L455-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1905#L460-1 assume !(1 == ~wl_pc~0); 2152#$Ultimate##44 assume !(2 == ~wl_pc~0); 2007#L473 assume !(1 == ~c1_pc~0); 2070#L483 assume !(1 == ~c2_pc~0); 2061#L492 assume !(1 == ~wb_pc~0); 1954#L501 assume !(1 == ~e_c~0); 1923#L510-1 assume !(1 == ~e_e~0); 1909#L515-1 assume !(1 == ~e_f~0); 1891#L520-1 assume !(1 == ~e_g~0); 1892#L525-1 assume !(1 == ~e_c~0); 1945#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1987#L672-1 [2024-10-15 01:00:21,427 INFO L747 eck$LassoCheckResult]: Loop: 1987#L672-1 assume !false; 2014#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 2015#L377 assume !false; 2084#L295 assume !(0 == ~wl_st~0); 1936#L299 assume !(0 == ~c1_st~0); 1937#L302 assume !(0 == ~c2_st~0); 1968#L305 assume !(0 == ~wb_st~0); 1882#L308 assume !(0 == ~r_st~0); 1884#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1967#L548 assume !(1 == ~c_req_up~0); 1880#L548-2 start_simulation_~kernel_st~0#1 := 3; 1881#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1912#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1901#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1902#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1931#L575-1 assume !(0 == ~e_wl~0); 1932#L580-1 assume 1 == ~wl_pc~0; 2004#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1997#L593 assume !(1 == ~c1_pc~0); 2039#L603 assume !(1 == ~c2_pc~0); 2038#L612 assume !(1 == ~wb_pc~0); 2036#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 2034#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 2031#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2028#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 2025#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 2022#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2019#L655-1 assume 0 == ~wl_st~0; 1987#L672-1 [2024-10-15 01:00:21,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:21,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2560361, now seen corresponding path program 1 times [2024-10-15 01:00:21,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:21,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932067482] [2024-10-15 01:00:21,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:21,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:21,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:21,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:00:21,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932067482] [2024-10-15 01:00:21,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932067482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:00:21,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:00:21,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 01:00:21,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73638858] [2024-10-15 01:00:21,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:00:21,476 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 01:00:21,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:21,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233099, now seen corresponding path program 1 times [2024-10-15 01:00:21,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:21,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897396722] [2024-10-15 01:00:21,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:21,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:21,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:00:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:21,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 01:00:21,838 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 01:00:21,838 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 01:00:21,838 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 01:00:21,839 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 01:00:21,839 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 01:00:21,839 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:21,839 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 01:00:21,839 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 01:00:21,839 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration7_Loop [2024-10-15 01:00:21,839 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 01:00:21,839 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 01:00:21,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:21,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,116 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 01:00:22,117 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 01:00:22,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:22,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:22,120 INFO L229 MonitoredProcess]: Starting monitored process 2 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-10-15 01:00:22,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-15 01:00:22,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 01:00:22,123 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:00:22,144 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 01:00:22,144 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 01:00:22,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-15 01:00:22,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:22,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:22,158 INFO L229 MonitoredProcess]: Starting monitored process 3 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-10-15 01:00:22,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-15 01:00:22,164 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 01:00:22,164 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:00:22,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-15 01:00:22,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:22,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:22,188 INFO L229 MonitoredProcess]: Starting monitored process 4 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-10-15 01:00:22,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-15 01:00:22,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 01:00:22,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:00:22,204 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 01:00:22,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-15 01:00:22,219 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 01:00:22,219 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 01:00:22,219 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 01:00:22,219 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 01:00:22,219 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 01:00:22,219 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:22,219 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 01:00:22,219 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 01:00:22,219 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration7_Loop [2024-10-15 01:00:22,219 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 01:00:22,219 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 01:00:22,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:22,445 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 01:00:22,449 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 01:00:22,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:22,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:22,451 INFO L229 MonitoredProcess]: Starting monitored process 5 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-10-15 01:00:22,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-15 01:00:22,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:00:22,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:00:22,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:00:22,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:00:22,468 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-15 01:00:22,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:00:22,471 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-15 01:00:22,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:00:22,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:00:22,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-15 01:00:22,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:22,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:22,488 INFO L229 MonitoredProcess]: Starting monitored process 6 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-10-15 01:00:22,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-15 01:00:22,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:00:22,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:00:22,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:00:22,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:00:22,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:00:22,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:00:22,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:00:22,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:00:22,506 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 01:00:22,512 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 01:00:22,512 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 01:00:22,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:22,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:22,519 INFO L229 MonitoredProcess]: Starting monitored process 7 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-10-15 01:00:22,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-15 01:00:22,524 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 01:00:22,524 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 01:00:22,524 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 01:00:22,524 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2024-10-15 01:00:22,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-15 01:00:22,541 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 01:00:22,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:22,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 01:00:22,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 01:00:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:22,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 01:00:22,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 01:00:22,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:22,698 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-15 01:00:22,699 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 333 states and 564 transitions. cyclomatic complexity: 232 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-15 01:00:22,759 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 333 states and 564 transitions. cyclomatic complexity: 232. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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) Result 1203 states and 2018 transitions. Complement of second has 5 states. [2024-10-15 01:00:22,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 01:00:22,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-15 01:00:22,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2024-10-15 01:00:22,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 28 letters. [2024-10-15 01:00:22,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 01:00:22,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 52 letters. Loop has 28 letters. [2024-10-15 01:00:22,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 01:00:22,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 56 letters. [2024-10-15 01:00:22,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 01:00:22,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1203 states and 2018 transitions. [2024-10-15 01:00:22,771 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 858 [2024-10-15 01:00:22,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1203 states to 1203 states and 2018 transitions. [2024-10-15 01:00:22,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 906 [2024-10-15 01:00:22,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 911 [2024-10-15 01:00:22,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1203 states and 2018 transitions. [2024-10-15 01:00:22,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 01:00:22,777 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1203 states and 2018 transitions. [2024-10-15 01:00:22,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states and 2018 transitions. [2024-10-15 01:00:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 912. [2024-10-15 01:00:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 912 states have (on average 1.6798245614035088) internal successors, (1532), 911 states have internal predecessors, (1532), 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-10-15 01:00:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1532 transitions. [2024-10-15 01:00:22,790 INFO L240 hiAutomatonCegarLoop]: Abstraction has 912 states and 1532 transitions. [2024-10-15 01:00:22,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:00:22,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 01:00:22,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 01:00:22,790 INFO L87 Difference]: Start difference. First operand 912 states and 1532 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-15 01:00:22,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:00:22,863 INFO L93 Difference]: Finished difference Result 1522 states and 2526 transitions. [2024-10-15 01:00:22,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1522 states and 2526 transitions. [2024-10-15 01:00:22,870 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1015 [2024-10-15 01:00:22,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1522 states to 1522 states and 2526 transitions. [2024-10-15 01:00:22,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1118 [2024-10-15 01:00:22,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1118 [2024-10-15 01:00:22,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1522 states and 2526 transitions. [2024-10-15 01:00:22,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 01:00:22,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1522 states and 2526 transitions. [2024-10-15 01:00:22,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states and 2526 transitions. [2024-10-15 01:00:22,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1469. [2024-10-15 01:00:22,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1469 states have (on average 1.6589516678012253) internal successors, (2437), 1468 states have internal predecessors, (2437), 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-10-15 01:00:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2437 transitions. [2024-10-15 01:00:22,897 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1469 states and 2437 transitions. [2024-10-15 01:00:22,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 01:00:22,898 INFO L425 stractBuchiCegarLoop]: Abstraction has 1469 states and 2437 transitions. [2024-10-15 01:00:22,898 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-15 01:00:22,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1469 states and 2437 transitions. [2024-10-15 01:00:22,903 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1013 [2024-10-15 01:00:22,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:00:22,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:00:22,904 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:22,904 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:22,904 INFO L745 eck$LassoCheckResult]: Stem: 6118#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 6119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 6148#L404 assume !(1 == ~c_req_up~0); 6191#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6088#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6089#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6165#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6142#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 6143#L435-1 assume !(0 == ~e_f~0); 6099#L440-1 assume !(0 == ~e_g~0); 6100#L445-1 assume !(0 == ~e_e~0); 6151#L450-1 assume !(0 == ~e_c~0); 6086#L455-1 assume !(0 == ~e_wl~0); 6087#L460-1 assume !(1 == ~wl_pc~0); 6227#$Ultimate##44 assume !(2 == ~wl_pc~0); 6173#L473 assume !(1 == ~c1_pc~0); 6291#L483 assume !(1 == ~c2_pc~0); 6287#L492 assume !(1 == ~wb_pc~0); 6150#L501 assume !(1 == ~e_c~0); 6116#L510-1 assume !(1 == ~e_e~0); 6117#L515-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6064#L520-1 assume !(1 == ~e_g~0); 6065#L525-1 assume !(1 == ~e_c~0); 6152#L530-1 assume !(1 == ~e_wl~0); 6196#L672-1 [2024-10-15 01:00:22,904 INFO L747 eck$LassoCheckResult]: Loop: 6196#L672-1 assume !false; 6030#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 6031#L377 assume !false; 6297#L295 assume !(0 == ~wl_st~0); 7264#L299 assume !(0 == ~c1_st~0); 7263#L302 assume !(0 == ~c2_st~0); 7262#L305 assume !(0 == ~wb_st~0); 7260#L308 assume !(0 == ~r_st~0); 7259#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 7257#L548 assume !(1 == ~c_req_up~0); 7256#L548-2 start_simulation_~kernel_st~0#1 := 3; 7255#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 7130#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 6080#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 6081#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 6969#L575-1 assume !(0 == ~e_wl~0); 6898#L580-1 assume 1 == ~wl_pc~0; 6964#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 6235#L593 assume !(1 == ~c1_pc~0); 6162#L603 assume !(1 == ~c2_pc~0); 6014#L612 assume !(1 == ~wb_pc~0); 6016#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 6970#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 6925#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6924#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 6922#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 6921#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 6899#L655-1 assume 0 == ~wl_st~0; 6196#L672-1 [2024-10-15 01:00:22,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash 255545497, now seen corresponding path program 1 times [2024-10-15 01:00:22,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:22,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585466586] [2024-10-15 01:00:22,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:22,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:22,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:22,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:00:22,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585466586] [2024-10-15 01:00:22,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585466586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:00:22,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:00:22,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 01:00:22,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569966982] [2024-10-15 01:00:22,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:00:22,936 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 01:00:22,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:22,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233099, now seen corresponding path program 2 times [2024-10-15 01:00:22,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:22,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367070433] [2024-10-15 01:00:22,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:22,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:22,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:00:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:22,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 01:00:23,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-15 01:00:23,352 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 01:00:23,352 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 01:00:23,352 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 01:00:23,353 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 01:00:23,353 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 01:00:23,353 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:23,353 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 01:00:23,353 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 01:00:23,353 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration8_Loop [2024-10-15 01:00:23,353 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 01:00:23,353 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 01:00:23,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:23,903 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 01:00:23,903 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 01:00:23,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:23,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:23,907 INFO L229 MonitoredProcess]: Starting monitored process 8 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-10-15 01:00:23,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-15 01:00:23,910 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 01:00:23,910 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:00:23,929 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 01:00:23,929 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 01:00:23,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-15 01:00:23,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:23,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:23,942 INFO L229 MonitoredProcess]: Starting monitored process 9 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-10-15 01:00:23,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-15 01:00:23,944 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 01:00:23,944 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:00:23,959 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 01:00:23,959 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet6#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 01:00:23,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-15 01:00:23,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:23,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:23,972 INFO L229 MonitoredProcess]: Starting monitored process 10 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-10-15 01:00:23,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-15 01:00:23,974 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 01:00:23,978 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:00:23,992 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 01:00:23,992 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet8#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 01:00:24,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-15 01:00:24,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:24,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:24,005 INFO L229 MonitoredProcess]: Starting monitored process 11 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-10-15 01:00:24,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-15 01:00:24,007 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 01:00:24,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:00:24,026 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 01:00:24,026 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 01:00:24,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-15 01:00:24,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:24,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:24,039 INFO L229 MonitoredProcess]: Starting monitored process 12 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-10-15 01:00:24,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-15 01:00:24,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 01:00:24,041 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:00:24,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-15 01:00:24,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:24,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:24,068 INFO L229 MonitoredProcess]: Starting monitored process 13 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-10-15 01:00:24,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-15 01:00:24,071 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 01:00:24,071 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:00:24,090 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 01:00:24,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-15 01:00:24,112 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 01:00:24,112 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 01:00:24,112 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 01:00:24,112 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 01:00:24,113 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 01:00:24,113 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:24,113 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 01:00:24,113 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 01:00:24,113 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration8_Loop [2024-10-15 01:00:24,113 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 01:00:24,113 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 01:00:24,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:24,325 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 01:00:24,325 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 01:00:24,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:24,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:24,327 INFO L229 MonitoredProcess]: Starting monitored process 14 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-10-15 01:00:24,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-15 01:00:24,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:00:24,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:00:24,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:00:24,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:00:24,346 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-15 01:00:24,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:00:24,347 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-15 01:00:24,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:00:24,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:00:24,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-15 01:00:24,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:24,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:24,361 INFO L229 MonitoredProcess]: Starting monitored process 15 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-10-15 01:00:24,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-15 01:00:24,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:00:24,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:00:24,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:00:24,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:00:24,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:00:24,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:00:24,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:00:24,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:00:24,375 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:00:24,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-15 01:00:24,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:24,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:24,389 INFO L229 MonitoredProcess]: Starting monitored process 16 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-10-15 01:00:24,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-15 01:00:24,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:00:24,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:00:24,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:00:24,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:00:24,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:00:24,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:00:24,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:00:24,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:00:24,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:00:24,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-15 01:00:24,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:24,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:24,415 INFO L229 MonitoredProcess]: Starting monitored process 17 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-10-15 01:00:24,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-15 01:00:24,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:00:24,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:00:24,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:00:24,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:00:24,428 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-15 01:00:24,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:00:24,428 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-15 01:00:24,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:00:24,430 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:00:24,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-15 01:00:24,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:24,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:24,443 INFO L229 MonitoredProcess]: Starting monitored process 18 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-10-15 01:00:24,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-15 01:00:24,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:00:24,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:00:24,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:00:24,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:00:24,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:00:24,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:00:24,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:00:24,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:00:24,458 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 01:00:24,460 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 01:00:24,460 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 01:00:24,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:24,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:24,462 INFO L229 MonitoredProcess]: Starting monitored process 19 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-10-15 01:00:24,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-15 01:00:24,464 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 01:00:24,464 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 01:00:24,464 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 01:00:24,464 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2024-10-15 01:00:24,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-15 01:00:24,476 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 01:00:24,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:24,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 01:00:24,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 01:00:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:24,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 01:00:24,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 01:00:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:24,590 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-15 01:00:24,590 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1469 states and 2437 transitions. cyclomatic complexity: 973 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-15 01:00:24,627 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1469 states and 2437 transitions. cyclomatic complexity: 973. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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) Result 3132 states and 5186 transitions. Complement of second has 5 states. [2024-10-15 01:00:24,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 01:00:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-15 01:00:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2024-10-15 01:00:24,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 28 letters. [2024-10-15 01:00:24,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 01:00:24,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 52 letters. Loop has 28 letters. [2024-10-15 01:00:24,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 01:00:24,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 56 letters. [2024-10-15 01:00:24,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 01:00:24,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3132 states and 5186 transitions. [2024-10-15 01:00:24,644 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 2026 [2024-10-15 01:00:24,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3132 states to 3132 states and 5186 transitions. [2024-10-15 01:00:24,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2087 [2024-10-15 01:00:24,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2096 [2024-10-15 01:00:24,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3132 states and 5186 transitions. [2024-10-15 01:00:24,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 01:00:24,657 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3132 states and 5186 transitions. [2024-10-15 01:00:24,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states and 5186 transitions. [2024-10-15 01:00:24,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 1927. [2024-10-15 01:00:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1927 states have (on average 1.6564608199273483) internal successors, (3192), 1926 states have internal predecessors, (3192), 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-10-15 01:00:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 3192 transitions. [2024-10-15 01:00:24,685 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1927 states and 3192 transitions. [2024-10-15 01:00:24,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:00:24,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 01:00:24,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 01:00:24,685 INFO L87 Difference]: Start difference. First operand 1927 states and 3192 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-15 01:00:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:00:24,770 INFO L93 Difference]: Finished difference Result 3375 states and 5492 transitions. [2024-10-15 01:00:24,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3375 states and 5492 transitions. [2024-10-15 01:00:24,782 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1952 [2024-10-15 01:00:24,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3375 states to 3375 states and 5492 transitions. [2024-10-15 01:00:24,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2068 [2024-10-15 01:00:24,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2068 [2024-10-15 01:00:24,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3375 states and 5492 transitions. [2024-10-15 01:00:24,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 01:00:24,796 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3375 states and 5492 transitions. [2024-10-15 01:00:24,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3375 states and 5492 transitions. [2024-10-15 01:00:24,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3375 to 3342. [2024-10-15 01:00:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3342 states, 3342 states have (on average 1.6334530221424297) internal successors, (5459), 3341 states have internal predecessors, (5459), 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-10-15 01:00:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3342 states to 3342 states and 5459 transitions. [2024-10-15 01:00:24,837 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3342 states and 5459 transitions. [2024-10-15 01:00:24,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 01:00:24,838 INFO L425 stractBuchiCegarLoop]: Abstraction has 3342 states and 5459 transitions. [2024-10-15 01:00:24,838 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-15 01:00:24,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3342 states and 5459 transitions. [2024-10-15 01:00:24,847 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1946 [2024-10-15 01:00:24,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:00:24,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:00:24,847 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:24,848 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:24,848 INFO L745 eck$LassoCheckResult]: Stem: 16202#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 16203#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 16235#L404 assume !(1 == ~c_req_up~0); 16284#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 16285#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 16256#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 16257#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 16230#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 16231#L435-1 assume !(0 == ~e_f~0); 16183#L440-1 assume !(0 == ~e_g~0); 16184#L445-1 assume !(0 == ~e_e~0); 16246#L450-1 assume 0 == ~e_c~0;~e_c~0 := 1; 16171#L455-1 assume !(0 == ~e_wl~0); 16172#L460-1 assume !(1 == ~wl_pc~0); 16358#$Ultimate##44 assume !(2 == ~wl_pc~0); 16266#L473 assume !(1 == ~c1_pc~0); 16371#L483 assume !(1 == ~c2_pc~0); 16152#L492 assume !(1 == ~wb_pc~0); 16263#L501 assume !(1 == ~e_c~0); 16264#L510-1 assume !(1 == ~e_e~0); 16422#L515-1 assume !(1 == ~e_f~0); 16423#L520-1 assume !(1 == ~e_g~0); 16418#L525-1 assume !(1 == ~e_c~0); 16419#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 16340#L672-1 assume !false; 16440#L542 [2024-10-15 01:00:24,848 INFO L747 eck$LassoCheckResult]: Loop: 16440#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 18351#L377 assume !false; 18352#L295 assume !(0 == ~wl_st~0); 18748#L299 assume !(0 == ~c1_st~0); 18747#L302 assume !(0 == ~c2_st~0); 18746#L305 assume !(0 == ~wb_st~0); 18094#L308 assume !(0 == ~r_st~0); 16347#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 16348#L548 assume !(1 == ~c_req_up~0); 18470#L548-2 start_simulation_~kernel_st~0#1 := 3; 18471#L560 assume !(0 == ~e_f~0); 18744#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 18737#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 18738#L570-1 assume !(0 == ~e_c~0); 18728#L575-1 assume !(0 == ~e_wl~0); 18726#L580-1 assume 1 == ~wl_pc~0; 18724#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 18725#L593 assume !(1 == ~c1_pc~0); 18860#L603 assume !(1 == ~c2_pc~0); 18857#L612 assume !(1 == ~wb_pc~0); 18854#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 18852#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 18850#L635-1 assume !(1 == ~e_f~0); 18847#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 18845#L645-1 assume !(1 == ~e_c~0); 18844#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 17610#L655-1 assume 0 == ~wl_st~0; 18841#L672-1 assume !false; 16440#L542 [2024-10-15 01:00:24,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:24,848 INFO L85 PathProgramCache]: Analyzing trace with hash 344940224, now seen corresponding path program 1 times [2024-10-15 01:00:24,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:24,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893042932] [2024-10-15 01:00:24,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:24,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:24,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:00:24,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893042932] [2024-10-15 01:00:24,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893042932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:00:24,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:00:24,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 01:00:24,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663491965] [2024-10-15 01:00:24,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:00:24,873 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 01:00:24,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:24,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1890226441, now seen corresponding path program 1 times [2024-10-15 01:00:24,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:24,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778579298] [2024-10-15 01:00:24,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:24,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:24,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:00:24,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778579298] [2024-10-15 01:00:24,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778579298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:00:24,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:00:24,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 01:00:24,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833990907] [2024-10-15 01:00:24,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:00:24,885 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 01:00:24,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:00:24,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 01:00:24,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 01:00:24,886 INFO L87 Difference]: Start difference. First operand 3342 states and 5459 transitions. cyclomatic complexity: 2132 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-10-15 01:00:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:00:24,958 INFO L93 Difference]: Finished difference Result 3395 states and 5500 transitions. [2024-10-15 01:00:24,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3395 states and 5500 transitions. [2024-10-15 01:00:24,970 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1979 [2024-10-15 01:00:25,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3395 states to 3395 states and 5500 transitions. [2024-10-15 01:00:25,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2098 [2024-10-15 01:00:25,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2098 [2024-10-15 01:00:25,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3395 states and 5500 transitions. [2024-10-15 01:00:25,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 01:00:25,007 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3395 states and 5500 transitions. [2024-10-15 01:00:25,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3395 states and 5500 transitions. [2024-10-15 01:00:25,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-15 01:00:25,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3395 to 3141. [2024-10-15 01:00:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3141 states have (on average 1.6275071633237823) internal successors, (5112), 3140 states have internal predecessors, (5112), 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-10-15 01:00:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 5112 transitions. [2024-10-15 01:00:25,060 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3141 states and 5112 transitions. [2024-10-15 01:00:25,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 01:00:25,064 INFO L425 stractBuchiCegarLoop]: Abstraction has 3141 states and 5112 transitions. [2024-10-15 01:00:25,064 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-15 01:00:25,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3141 states and 5112 transitions. [2024-10-15 01:00:25,070 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1979 [2024-10-15 01:00:25,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:00:25,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:00:25,072 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:25,072 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:25,072 INFO L745 eck$LassoCheckResult]: Stem: 22950#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 22951#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 22980#L404 assume !(1 == ~c_req_up~0); 23044#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 22919#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 22920#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 23077#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 22975#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 22976#L435-1 assume !(0 == ~e_f~0); 22930#L440-1 assume !(0 == ~e_g~0); 22931#L445-1 assume !(0 == ~e_e~0); 22991#L450-1 assume !(0 == ~e_c~0); 22917#L455-1 assume !(0 == ~e_wl~0); 22918#L460-1 assume !(1 == ~wl_pc~0); 23086#$Ultimate##44 assume !(2 == ~wl_pc~0); 23010#L473 assume !(1 == ~c1_pc~0); 23157#L483 assume !(1 == ~c2_pc~0); 23156#L492 assume !(1 == ~wb_pc~0); 23150#L501 assume !(1 == ~e_c~0); 23151#L510-1 assume !(1 == ~e_e~0); 22921#L515-1 assume !(1 == ~e_f~0); 22922#L520-1 assume !(1 == ~e_g~0); 22985#L525-1 assume !(1 == ~e_c~0); 22986#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 23074#L672-1 assume !false; 25327#L542 [2024-10-15 01:00:25,073 INFO L747 eck$LassoCheckResult]: Loop: 25327#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 25326#L377 assume !false; 25325#L295 assume !(0 == ~wl_st~0); 24890#L299 assume !(0 == ~c1_st~0); 24884#L302 assume !(0 == ~c2_st~0); 24885#L305 assume !(0 == ~wb_st~0); 24876#L308 assume !(0 == ~r_st~0); 24878#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 24546#L548 assume !(1 == ~c_req_up~0); 24547#L548-2 start_simulation_~kernel_st~0#1 := 3; 22927#L560 assume !(0 == ~e_f~0); 22928#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 23087#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 25820#L570-1 assume !(0 == ~e_c~0); 25415#L575-1 assume !(0 == ~e_wl~0); 25412#L580-1 assume 1 == ~wl_pc~0; 25411#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 23093#L593 assume !(1 == ~c1_pc~0); 25398#L603 assume !(1 == ~c2_pc~0); 25393#L612 assume !(1 == ~wb_pc~0); 25387#L621 assume !(1 == ~e_c~0); 25384#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 25381#L635-1 assume !(1 == ~e_f~0); 25378#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 25374#L645-1 assume !(1 == ~e_c~0); 25369#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 25360#L655-1 assume 0 == ~wl_st~0; 25358#L672-1 assume !false; 25327#L542 [2024-10-15 01:00:25,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:25,074 INFO L85 PathProgramCache]: Analyzing trace with hash -666177026, now seen corresponding path program 1 times [2024-10-15 01:00:25,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:25,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359500559] [2024-10-15 01:00:25,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:25,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:25,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:00:25,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359500559] [2024-10-15 01:00:25,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359500559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:00:25,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:00:25,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 01:00:25,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858531996] [2024-10-15 01:00:25,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:00:25,107 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 01:00:25,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:25,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1080879815, now seen corresponding path program 1 times [2024-10-15 01:00:25,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:25,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638039454] [2024-10-15 01:00:25,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:25,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:25,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:00:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:25,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 01:00:25,309 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 01:00:25,309 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 01:00:25,309 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 01:00:25,309 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 01:00:25,309 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 01:00:25,309 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:25,309 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 01:00:25,309 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 01:00:25,310 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration10_Loop [2024-10-15 01:00:25,310 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 01:00:25,310 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 01:00:25,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,527 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 01:00:25,528 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 01:00:25,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:25,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:25,532 INFO L229 MonitoredProcess]: Starting monitored process 20 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-10-15 01:00:25,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-15 01:00:25,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 01:00:25,538 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:00:25,550 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 01:00:25,550 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet4#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 01:00:25,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-15 01:00:25,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:25,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:25,567 INFO L229 MonitoredProcess]: Starting monitored process 21 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-10-15 01:00:25,572 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 01:00:25,572 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:00:25,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-15 01:00:25,585 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 01:00:25,585 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 01:00:25,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-15 01:00:25,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:25,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:25,598 INFO L229 MonitoredProcess]: Starting monitored process 22 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-10-15 01:00:25,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-15 01:00:25,600 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 01:00:25,600 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:00:25,618 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 01:00:25,618 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=-1} Honda state: {~r_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 01:00:25,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-15 01:00:25,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:25,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:25,631 INFO L229 MonitoredProcess]: Starting monitored process 23 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-10-15 01:00:25,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-15 01:00:25,632 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 01:00:25,632 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:00:25,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-15 01:00:25,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:25,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:25,659 INFO L229 MonitoredProcess]: Starting monitored process 24 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-10-15 01:00:25,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-15 01:00:25,660 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 01:00:25,660 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:00:25,672 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 01:00:25,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-15 01:00:25,684 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 01:00:25,684 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 01:00:25,684 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 01:00:25,684 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 01:00:25,684 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 01:00:25,684 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:25,684 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 01:00:25,684 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 01:00:25,684 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration10_Loop [2024-10-15 01:00:25,684 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 01:00:25,684 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 01:00:25,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:00:25,891 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 01:00:25,891 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 01:00:25,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:25,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:25,893 INFO L229 MonitoredProcess]: Starting monitored process 25 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-10-15 01:00:25,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-15 01:00:25,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:00:25,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:00:25,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:00:25,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:00:25,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:00:25,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:00:25,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:00:25,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:00:25,912 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:00:25,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-15 01:00:25,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:25,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:25,925 INFO L229 MonitoredProcess]: Starting monitored process 26 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-10-15 01:00:25,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-15 01:00:25,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:00:25,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:00:25,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:00:25,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:00:25,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:00:25,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:00:25,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:00:25,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:00:25,939 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:00:25,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-15 01:00:25,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:25,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:25,953 INFO L229 MonitoredProcess]: Starting monitored process 27 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-10-15 01:00:25,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-15 01:00:25,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:00:25,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:00:25,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:00:25,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:00:25,965 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-15 01:00:25,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:00:25,966 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-15 01:00:25,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:00:25,967 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:00:25,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-15 01:00:25,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:25,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:25,980 INFO L229 MonitoredProcess]: Starting monitored process 28 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-10-15 01:00:25,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-15 01:00:25,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:00:25,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:00:25,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:00:25,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:00:25,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:00:25,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:00:25,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:00:25,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:00:26,001 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 01:00:26,004 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 01:00:26,004 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 01:00:26,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:00:26,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:00:26,008 INFO L229 MonitoredProcess]: Starting monitored process 29 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-10-15 01:00:26,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-15 01:00:26,010 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 01:00:26,010 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 01:00:26,013 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 01:00:26,013 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2024-10-15 01:00:26,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-15 01:00:26,025 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 01:00:26,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:26,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 01:00:26,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 01:00:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:26,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 01:00:26,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 01:00:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:26,142 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-15 01:00:26,142 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3141 states and 5112 transitions. cyclomatic complexity: 1984 Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-10-15 01:00:26,189 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3141 states and 5112 transitions. cyclomatic complexity: 1984. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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) Result 6730 states and 10970 transitions. Complement of second has 5 states. [2024-10-15 01:00:26,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 01:00:26,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-10-15 01:00:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2024-10-15 01:00:26,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 25 letters. Loop has 28 letters. [2024-10-15 01:00:26,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 01:00:26,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 53 letters. Loop has 28 letters. [2024-10-15 01:00:26,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 01:00:26,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 25 letters. Loop has 56 letters. [2024-10-15 01:00:26,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 01:00:26,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6730 states and 10970 transitions. [2024-10-15 01:00:26,218 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 3115 [2024-10-15 01:00:26,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6730 states to 6730 states and 10970 transitions. [2024-10-15 01:00:26,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3227 [2024-10-15 01:00:26,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3262 [2024-10-15 01:00:26,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6730 states and 10970 transitions. [2024-10-15 01:00:26,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 01:00:26,247 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6730 states and 10970 transitions. [2024-10-15 01:00:26,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6730 states and 10970 transitions. [2024-10-15 01:00:26,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6730 to 6695. [2024-10-15 01:00:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6695 states, 6695 states have (on average 1.6298730395817775) internal successors, (10912), 6694 states have internal predecessors, (10912), 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-10-15 01:00:26,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-15 01:00:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6695 states to 6695 states and 10912 transitions. [2024-10-15 01:00:26,425 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6695 states and 10912 transitions. [2024-10-15 01:00:26,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:00:26,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 01:00:26,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 01:00:26,425 INFO L87 Difference]: Start difference. First operand 6695 states and 10912 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-10-15 01:00:26,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:00:26,499 INFO L93 Difference]: Finished difference Result 7180 states and 11526 transitions. [2024-10-15 01:00:26,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7180 states and 11526 transitions. [2024-10-15 01:00:26,522 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2859 [2024-10-15 01:00:26,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7180 states to 7180 states and 11526 transitions. [2024-10-15 01:00:26,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2935 [2024-10-15 01:00:26,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2935 [2024-10-15 01:00:26,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7180 states and 11526 transitions. [2024-10-15 01:00:26,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 01:00:26,547 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7180 states and 11526 transitions. [2024-10-15 01:00:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7180 states and 11526 transitions. [2024-10-15 01:00:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7180 to 7168. [2024-10-15 01:00:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7168 states, 7168 states have (on average 1.6063058035714286) internal successors, (11514), 7167 states have internal predecessors, (11514), 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-10-15 01:00:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7168 states to 7168 states and 11514 transitions. [2024-10-15 01:00:26,636 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7168 states and 11514 transitions. [2024-10-15 01:00:26,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 01:00:26,636 INFO L425 stractBuchiCegarLoop]: Abstraction has 7168 states and 11514 transitions. [2024-10-15 01:00:26,636 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-15 01:00:26,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7168 states and 11514 transitions. [2024-10-15 01:00:26,652 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2859 [2024-10-15 01:00:26,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:00:26,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:00:26,653 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:26,653 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:26,653 INFO L745 eck$LassoCheckResult]: Stem: 46881#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 46882#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 46917#L404 assume !(1 == ~c_req_up~0); 46965#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 46849#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 46850#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 47017#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 46909#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 46910#L435-1 assume !(0 == ~e_f~0); 46861#L440-1 assume !(0 == ~e_g~0); 46862#L445-1 assume !(0 == ~e_e~0); 46920#L450-1 assume !(0 == ~e_c~0); 46847#L455-1 assume !(0 == ~e_wl~0); 46848#L460-1 assume !(1 == ~wl_pc~0); 47002#$Ultimate##44 assume !(2 == ~wl_pc~0); 46947#L473 assume !(1 == ~c1_pc~0); 47042#L483 assume !(1 == ~c2_pc~0); 46827#L492 assume !(1 == ~wb_pc~0); 46942#L501 assume !(1 == ~e_c~0); 46943#L510-1 assume !(1 == ~e_e~0); 46851#L515-1 assume !(1 == ~e_f~0); 46852#L520-1 assume !(1 == ~e_g~0); 46921#L525-1 assume !(1 == ~e_c~0); 46922#L530-1 assume !(1 == ~e_wl~0); 47014#L672-1 assume !false; 49051#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 51668#L377 [2024-10-15 01:00:26,654 INFO L747 eck$LassoCheckResult]: Loop: 51668#L377 assume !false; 51666#L295 assume 0 == ~wl_st~0; 51663#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 51664#L321 assume !(0 != eval_~tmp~0#1); 51801#L317 assume !(0 == ~c1_st~0); 51794#L332 assume !(0 == ~c2_st~0); 51005#L347 assume !(0 == ~wb_st~0); 51002#L362 assume !(0 == ~r_st~0); 51668#L377 [2024-10-15 01:00:26,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:26,654 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2024-10-15 01:00:26,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:26,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202144943] [2024-10-15 01:00:26,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:26,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:26,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:00:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:26,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 01:00:26,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:26,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1279860915, now seen corresponding path program 1 times [2024-10-15 01:00:26,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:26,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539888595] [2024-10-15 01:00:26,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:26,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:26,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:00:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:26,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 01:00:26,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:26,670 INFO L85 PathProgramCache]: Analyzing trace with hash 360906411, now seen corresponding path program 1 times [2024-10-15 01:00:26,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:26,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533386270] [2024-10-15 01:00:26,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:26,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:26,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:00:26,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533386270] [2024-10-15 01:00:26,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533386270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:00:26,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:00:26,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 01:00:26,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546653090] [2024-10-15 01:00:26,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:00:26,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:00:26,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 01:00:26,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 01:00:26,714 INFO L87 Difference]: Start difference. First operand 7168 states and 11514 transitions. cyclomatic complexity: 4382 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-10-15 01:00:26,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:00:26,761 INFO L93 Difference]: Finished difference Result 11016 states and 17576 transitions. [2024-10-15 01:00:26,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11016 states and 17576 transitions. [2024-10-15 01:00:26,796 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4438 [2024-10-15 01:00:26,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11016 states to 11016 states and 17576 transitions. [2024-10-15 01:00:26,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4518 [2024-10-15 01:00:26,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4518 [2024-10-15 01:00:26,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11016 states and 17576 transitions. [2024-10-15 01:00:26,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 01:00:26,859 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11016 states and 17576 transitions. [2024-10-15 01:00:26,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11016 states and 17576 transitions. [2024-10-15 01:00:27,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11016 to 11016. [2024-10-15 01:00:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11016 states, 11016 states have (on average 1.5954974582425563) internal successors, (17576), 11015 states have internal predecessors, (17576), 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-10-15 01:00:27,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11016 states to 11016 states and 17576 transitions. [2024-10-15 01:00:27,102 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11016 states and 17576 transitions. [2024-10-15 01:00:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 01:00:27,103 INFO L425 stractBuchiCegarLoop]: Abstraction has 11016 states and 17576 transitions. [2024-10-15 01:00:27,103 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-15 01:00:27,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11016 states and 17576 transitions. [2024-10-15 01:00:27,126 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4438 [2024-10-15 01:00:27,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:00:27,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:00:27,127 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:27,127 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:27,128 INFO L745 eck$LassoCheckResult]: Stem: 65075#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 65076#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 65105#L404 assume !(1 == ~c_req_up~0); 65158#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 65044#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 65045#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 65213#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 65097#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 65098#L435-1 assume !(0 == ~e_f~0); 65054#L440-1 assume !(0 == ~e_g~0); 65055#L445-1 assume !(0 == ~e_e~0); 65108#L450-1 assume !(0 == ~e_c~0); 65042#L455-1 assume !(0 == ~e_wl~0); 65043#L460-1 assume !(1 == ~wl_pc~0); 65198#$Ultimate##44 assume !(2 == ~wl_pc~0); 65137#L473 assume !(1 == ~c1_pc~0); 65240#L483 assume !(1 == ~c2_pc~0); 65020#L492 assume !(1 == ~wb_pc~0); 65130#L501 assume !(1 == ~e_c~0); 65131#L510-1 assume !(1 == ~e_e~0); 65046#L515-1 assume !(1 == ~e_f~0); 65047#L520-1 assume !(1 == ~e_g~0); 65109#L525-1 assume !(1 == ~e_c~0); 65110#L530-1 assume !(1 == ~e_wl~0); 65210#L672-1 assume !false; 66474#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 70648#L377 [2024-10-15 01:00:27,128 INFO L747 eck$LassoCheckResult]: Loop: 70648#L377 assume !false; 72306#L295 assume 0 == ~wl_st~0; 72304#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 72300#L321 assume !(0 != eval_~tmp~0#1); 72301#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 72321#L336 assume !(0 != eval_~tmp___0~0#1); 72316#L332 assume !(0 == ~c2_st~0); 72315#L347 assume !(0 == ~wb_st~0); 72311#L362 assume !(0 == ~r_st~0); 70648#L377 [2024-10-15 01:00:27,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:27,128 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2024-10-15 01:00:27,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:27,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180545729] [2024-10-15 01:00:27,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:27,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:27,134 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:00:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:27,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 01:00:27,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:27,140 INFO L85 PathProgramCache]: Analyzing trace with hash 969256162, now seen corresponding path program 1 times [2024-10-15 01:00:27,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:27,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632970355] [2024-10-15 01:00:27,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:27,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:27,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:00:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:27,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 01:00:27,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:27,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1748529686, now seen corresponding path program 1 times [2024-10-15 01:00:27,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:27,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442993183] [2024-10-15 01:00:27,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:27,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:27,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:00:27,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442993183] [2024-10-15 01:00:27,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442993183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:00:27,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:00:27,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 01:00:27,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918224552] [2024-10-15 01:00:27,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:00:27,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:00:27,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 01:00:27,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 01:00:27,242 INFO L87 Difference]: Start difference. First operand 11016 states and 17576 transitions. cyclomatic complexity: 6596 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-10-15 01:00:27,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:00:27,318 INFO L93 Difference]: Finished difference Result 17164 states and 27055 transitions. [2024-10-15 01:00:27,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17164 states and 27055 transitions. [2024-10-15 01:00:27,544 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2024-10-15 01:00:27,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17164 states to 17164 states and 27055 transitions. [2024-10-15 01:00:27,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7102 [2024-10-15 01:00:27,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7102 [2024-10-15 01:00:27,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17164 states and 27055 transitions. [2024-10-15 01:00:27,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 01:00:27,667 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17164 states and 27055 transitions. [2024-10-15 01:00:27,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17164 states and 27055 transitions. [2024-10-15 01:00:27,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17164 to 17164. [2024-10-15 01:00:28,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17164 states, 17164 states have (on average 1.5762642740619903) internal successors, (27055), 17163 states have internal predecessors, (27055), 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-10-15 01:00:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17164 states to 17164 states and 27055 transitions. [2024-10-15 01:00:28,185 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17164 states and 27055 transitions. [2024-10-15 01:00:28,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 01:00:28,186 INFO L425 stractBuchiCegarLoop]: Abstraction has 17164 states and 27055 transitions. [2024-10-15 01:00:28,186 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-15 01:00:28,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17164 states and 27055 transitions. [2024-10-15 01:00:28,215 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2024-10-15 01:00:28,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:00:28,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:00:28,216 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:28,216 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:28,216 INFO L745 eck$LassoCheckResult]: Stem: 93260#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 93261#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 93291#L404 assume !(1 == ~c_req_up~0); 93361#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 93230#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 93231#L420-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 93470#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 95171#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 95170#L435-1 assume !(0 == ~e_f~0); 95169#L440-1 assume !(0 == ~e_g~0); 95168#L445-1 assume !(0 == ~e_e~0); 95167#L450-1 assume !(0 == ~e_c~0); 95166#L455-1 assume !(0 == ~e_wl~0); 95165#L460-1 assume !(1 == ~wl_pc~0); 95162#$Ultimate##44 assume !(2 == ~wl_pc~0); 95161#L473 assume !(1 == ~c1_pc~0); 95159#L483 assume !(1 == ~c2_pc~0); 93478#L492 assume !(1 == ~wb_pc~0); 93318#L501 assume !(1 == ~e_c~0); 93319#L510-1 assume !(1 == ~e_e~0); 93232#L515-1 assume !(1 == ~e_f~0); 93233#L520-1 assume !(1 == ~e_g~0); 93295#L525-1 assume !(1 == ~e_c~0); 93296#L530-1 assume !(1 == ~e_wl~0); 93398#L672-1 assume !false; 95172#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 104314#L377 [2024-10-15 01:00:28,216 INFO L747 eck$LassoCheckResult]: Loop: 104314#L377 assume !false; 107940#L295 assume 0 == ~wl_st~0; 107941#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 105989#L321 assume !(0 != eval_~tmp~0#1); 105990#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 107010#L336 assume !(0 != eval_~tmp___0~0#1); 107388#L332 assume !(0 == ~c2_st~0); 107419#L347 assume !(0 == ~wb_st~0); 107414#L362 assume !(0 == ~r_st~0); 104314#L377 [2024-10-15 01:00:28,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:28,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2024-10-15 01:00:28,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:28,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785639163] [2024-10-15 01:00:28,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:28,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:28,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:00:28,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785639163] [2024-10-15 01:00:28,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785639163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:00:28,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:00:28,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 01:00:28,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83420159] [2024-10-15 01:00:28,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:00:28,236 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 01:00:28,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:28,236 INFO L85 PathProgramCache]: Analyzing trace with hash 969256162, now seen corresponding path program 2 times [2024-10-15 01:00:28,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:28,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417229675] [2024-10-15 01:00:28,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:28,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:28,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:00:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:28,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 01:00:28,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:00:28,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 01:00:28,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 01:00:28,261 INFO L87 Difference]: Start difference. First operand 17164 states and 27055 transitions. cyclomatic complexity: 9927 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-10-15 01:00:28,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:00:28,299 INFO L93 Difference]: Finished difference Result 17112 states and 26968 transitions. [2024-10-15 01:00:28,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17112 states and 26968 transitions. [2024-10-15 01:00:28,346 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2024-10-15 01:00:28,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17112 states to 17112 states and 26968 transitions. [2024-10-15 01:00:28,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7052 [2024-10-15 01:00:28,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7052 [2024-10-15 01:00:28,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17112 states and 26968 transitions. [2024-10-15 01:00:28,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 01:00:28,399 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17112 states and 26968 transitions. [2024-10-15 01:00:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states and 26968 transitions. [2024-10-15 01:00:28,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 17112. [2024-10-15 01:00:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17112 states, 17112 states have (on average 1.575970079476391) internal successors, (26968), 17111 states have internal predecessors, (26968), 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-10-15 01:00:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17112 states to 17112 states and 26968 transitions. [2024-10-15 01:00:28,948 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17112 states and 26968 transitions. [2024-10-15 01:00:28,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 01:00:28,950 INFO L425 stractBuchiCegarLoop]: Abstraction has 17112 states and 26968 transitions. [2024-10-15 01:00:28,950 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-15 01:00:28,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17112 states and 26968 transitions. [2024-10-15 01:00:28,999 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2024-10-15 01:00:29,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:00:29,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:00:29,000 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:29,000 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:29,000 INFO L745 eck$LassoCheckResult]: Stem: 127544#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 127545#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 127576#L404 assume !(1 == ~c_req_up~0); 127626#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 127511#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 127512#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 127686#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 127571#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 127572#L435-1 assume !(0 == ~e_f~0); 127524#L440-1 assume !(0 == ~e_g~0); 127525#L445-1 assume !(0 == ~e_e~0); 127579#L450-1 assume !(0 == ~e_c~0); 127509#L455-1 assume !(0 == ~e_wl~0); 127510#L460-1 assume !(1 == ~wl_pc~0); 127671#$Ultimate##44 assume !(2 == ~wl_pc~0); 127607#L473 assume !(1 == ~c1_pc~0); 127713#L483 assume !(1 == ~c2_pc~0); 127487#L492 assume !(1 == ~wb_pc~0); 127602#L501 assume !(1 == ~e_c~0); 127603#L510-1 assume !(1 == ~e_e~0); 127513#L515-1 assume !(1 == ~e_f~0); 127514#L520-1 assume !(1 == ~e_g~0); 127580#L525-1 assume !(1 == ~e_c~0); 127581#L530-1 assume !(1 == ~e_wl~0); 127683#L672-1 assume !false; 129632#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 137103#L377 [2024-10-15 01:00:29,001 INFO L747 eck$LassoCheckResult]: Loop: 137103#L377 assume !false; 141877#L295 assume 0 == ~wl_st~0; 141378#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 141377#L321 assume !(0 != eval_~tmp~0#1); 141376#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 141336#L336 assume !(0 != eval_~tmp___0~0#1); 141024#L332 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 141020#L351 assume !(0 != eval_~tmp___1~0#1); 140965#L347 assume !(0 == ~wb_st~0); 140960#L362 assume !(0 == ~r_st~0); 137103#L377 [2024-10-15 01:00:29,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:29,001 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2024-10-15 01:00:29,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:29,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455651271] [2024-10-15 01:00:29,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:29,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:29,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:00:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:29,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 01:00:29,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:29,023 INFO L85 PathProgramCache]: Analyzing trace with hash -19480801, now seen corresponding path program 1 times [2024-10-15 01:00:29,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:29,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687620371] [2024-10-15 01:00:29,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:29,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:29,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:00:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:29,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 01:00:29,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:29,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1628503831, now seen corresponding path program 1 times [2024-10-15 01:00:29,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:29,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247084480] [2024-10-15 01:00:29,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:29,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:00:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:00:29,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:00:29,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247084480] [2024-10-15 01:00:29,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247084480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:00:29,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:00:29,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 01:00:29,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358055141] [2024-10-15 01:00:29,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:00:29,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:00:29,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 01:00:29,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 01:00:29,112 INFO L87 Difference]: Start difference. First operand 17112 states and 26968 transitions. cyclomatic complexity: 9892 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10-15 01:00:29,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:00:29,218 INFO L93 Difference]: Finished difference Result 29109 states and 45435 transitions. [2024-10-15 01:00:29,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29109 states and 45435 transitions. [2024-10-15 01:00:29,486 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 11874 [2024-10-15 01:00:29,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29109 states to 29109 states and 45435 transitions. [2024-10-15 01:00:29,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12004 [2024-10-15 01:00:29,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12004 [2024-10-15 01:00:29,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29109 states and 45435 transitions. [2024-10-15 01:00:29,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 01:00:29,646 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29109 states and 45435 transitions. [2024-10-15 01:00:29,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29109 states and 45435 transitions. [2024-10-15 01:00:30,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29109 to 29109. [2024-10-15 01:00:30,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29109 states, 29109 states have (on average 1.5608574667628567) internal successors, (45435), 29108 states have internal predecessors, (45435), 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-10-15 01:00:30,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29109 states to 29109 states and 45435 transitions. [2024-10-15 01:00:30,178 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29109 states and 45435 transitions. [2024-10-15 01:00:30,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 01:00:30,179 INFO L425 stractBuchiCegarLoop]: Abstraction has 29109 states and 45435 transitions. [2024-10-15 01:00:30,179 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-15 01:00:30,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29109 states and 45435 transitions. [2024-10-15 01:00:30,236 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 11874 [2024-10-15 01:00:30,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:00:30,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:00:30,238 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:30,238 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:00:30,238 INFO L745 eck$LassoCheckResult]: Stem: 173774#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 173775#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 173805#L404 assume !(1 == ~c_req_up~0); 173858#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 173741#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 173742#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 173919#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 173799#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 173800#L435-1 assume !(0 == ~e_f~0); 173754#L440-1 assume !(0 == ~e_g~0); 173755#L445-1 assume !(0 == ~e_e~0); 173808#L450-1 assume !(0 == ~e_c~0); 173739#L455-1 assume !(0 == ~e_wl~0); 173740#L460-1 assume !(1 == ~wl_pc~0); 173902#$Ultimate##44 assume !(2 == ~wl_pc~0); 173836#L473 assume !(1 == ~c1_pc~0); 173953#L483 assume !(1 == ~c2_pc~0); 173717#L492 assume !(1 == ~wb_pc~0); 173831#L501 assume !(1 == ~e_c~0); 173832#L510-1 assume !(1 == ~e_e~0); 173743#L515-1 assume !(1 == ~e_f~0); 173744#L520-1 assume !(1 == ~e_g~0); 173809#L525-1 assume !(1 == ~e_c~0); 173810#L530-1 assume !(1 == ~e_wl~0); 176228#L672-1 assume !false; 176229#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 188613#L377 [2024-10-15 01:00:30,239 INFO L747 eck$LassoCheckResult]: Loop: 188613#L377 assume !false; 197188#L295 assume 0 == ~wl_st~0; 197186#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 197184#L321 assume !(0 != eval_~tmp~0#1); 195819#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 195816#L336 assume !(0 != eval_~tmp___0~0#1); 195814#L332 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 195765#L351 assume !(0 != eval_~tmp___1~0#1); 195811#L347 assume 0 == ~wb_st~0;havoc eval_#t~nondet7#1;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 196125#L366 assume !(0 != eval_~tmp___2~0#1); 196135#L362 assume !(0 == ~r_st~0); 188613#L377 [2024-10-15 01:00:30,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:30,239 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2024-10-15 01:00:30,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:30,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519783307] [2024-10-15 01:00:30,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:30,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:30,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:00:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:30,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 01:00:30,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:30,249 INFO L85 PathProgramCache]: Analyzing trace with hash -603940234, now seen corresponding path program 1 times [2024-10-15 01:00:30,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:30,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246716654] [2024-10-15 01:00:30,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:30,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:30,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:00:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:30,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 01:00:30,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:00:30,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1056024194, now seen corresponding path program 1 times [2024-10-15 01:00:30,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:00:30,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486076624] [2024-10-15 01:00:30,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:00:30,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:00:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:30,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:00:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:30,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 01:00:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:31,134 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:00:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:00:31,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 01:00:31 BoogieIcfgContainer [2024-10-15 01:00:31,241 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 01:00:31,241 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 01:00:31,241 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 01:00:31,245 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 01:00:31,246 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:00:20" (3/4) ... [2024-10-15 01:00:31,247 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-15 01:00:31,331 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-15 01:00:31,331 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 01:00:31,331 INFO L158 Benchmark]: Toolchain (without parser) took 12192.84ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 72.0MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 323.4MB. Max. memory is 16.1GB. [2024-10-15 01:00:31,331 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 105.2MB in the end (delta: 301.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 01:00:31,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.79ms. Allocated memory is still 142.6MB. Free memory was 71.7MB in the beginning and 56.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-15 01:00:31,332 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.45ms. Allocated memory is still 142.6MB. Free memory was 56.0MB in the beginning and 53.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-15 01:00:31,332 INFO L158 Benchmark]: Boogie Preprocessor took 92.45ms. Allocated memory is still 142.6MB. Free memory was 53.5MB in the beginning and 50.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 01:00:31,332 INFO L158 Benchmark]: RCFGBuilder took 604.53ms. Allocated memory was 142.6MB in the beginning and 270.5MB in the end (delta: 127.9MB). Free memory was 50.7MB in the beginning and 220.1MB in the end (delta: -169.3MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-10-15 01:00:31,332 INFO L158 Benchmark]: BuchiAutomizer took 10971.73ms. Allocated memory was 270.5MB in the beginning and 2.8GB in the end (delta: 2.5GB). Free memory was 220.1MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 336.5MB. Max. memory is 16.1GB. [2024-10-15 01:00:31,332 INFO L158 Benchmark]: Witness Printer took 89.76ms. Allocated memory is still 2.8GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-15 01:00:31,333 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 105.2MB in the end (delta: 301.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.79ms. Allocated memory is still 142.6MB. Free memory was 71.7MB in the beginning and 56.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.45ms. Allocated memory is still 142.6MB. Free memory was 56.0MB in the beginning and 53.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.45ms. Allocated memory is still 142.6MB. Free memory was 53.5MB in the beginning and 50.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 604.53ms. Allocated memory was 142.6MB in the beginning and 270.5MB in the end (delta: 127.9MB). Free memory was 50.7MB in the beginning and 220.1MB in the end (delta: -169.3MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 10971.73ms. Allocated memory was 270.5MB in the beginning and 2.8GB in the end (delta: 2.5GB). Free memory was 220.1MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 336.5MB. Max. memory is 16.1GB. * Witness Printer took 89.76ms. Allocated memory is still 2.8GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 17 terminating modules (14 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long long) -1 * e_c) + 1) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -1 * e_c) + 1) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -1 * e_e) + 1) and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 29109 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.8s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 5.6s. Construction of modules took 0.3s. Büchi inclusion checks took 4.2s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 11. Automata minimization 2.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 1885 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 1.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4258 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4255 mSDsluCounter, 7039 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2579 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 357 IncrementalHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 4460 mSDtfsCounter, 357 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT0 SILN1 SILU0 SILI5 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital77 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf96 smp100 dnf147 smp91 tf109 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 294]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L689] int __retres1 ; [L693] e_wl = 2 [L694] e_c = e_wl [L695] e_g = e_c [L696] e_f = e_g [L697] e_e = e_f [L698] wl_pc = 0 [L699] c1_pc = 0 [L700] c2_pc = 0 [L701] wb_pc = 0 [L702] wb_i = 1 [L703] c2_i = wb_i [L704] c1_i = c2_i [L705] wl_i = c1_i [L706] r_i = 0 [L707] c_req_up = 0 [L708] d = 0 [L709] c = 0 [L710] CALL start_simulation() [L400] int kernel_st ; [L403] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L404] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L415] COND TRUE (int )wl_i == 1 [L416] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L420] COND TRUE (int )c1_i == 1 [L421] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L425] COND TRUE (int )c2_i == 1 [L426] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L430] COND TRUE (int )wb_i == 1 [L431] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L435] COND FALSE !((int )r_i == 1) [L438] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L440] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L445] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L450] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L455] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L460] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L465] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L473] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L483] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L492] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L501] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L510] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L515] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L520] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L525] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L530] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L535] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L541] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L544] kernel_st = 1 [L545] CALL eval() [L286] int tmp ; [L287] int tmp___0 ; [L288] int tmp___1 ; [L289] int tmp___2 ; [L290] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L294] COND TRUE 1 [L296] COND TRUE (int )wl_st == 0 [L317] COND TRUE (int )wl_st == 0 [L319] tmp = __VERIFIER_nondet_int() [L321] COND FALSE !(\read(tmp)) [L332] COND TRUE (int )c1_st == 0 [L334] tmp___0 = __VERIFIER_nondet_int() [L336] COND FALSE !(\read(tmp___0)) [L347] COND TRUE (int )c2_st == 0 [L349] tmp___1 = __VERIFIER_nondet_int() [L351] COND FALSE !(\read(tmp___1)) [L362] COND TRUE (int )wb_st == 0 [L364] tmp___2 = __VERIFIER_nondet_int() [L366] COND FALSE !(\read(tmp___2)) [L377] COND FALSE !((int )r_st == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 294]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L689] int __retres1 ; [L693] e_wl = 2 [L694] e_c = e_wl [L695] e_g = e_c [L696] e_f = e_g [L697] e_e = e_f [L698] wl_pc = 0 [L699] c1_pc = 0 [L700] c2_pc = 0 [L701] wb_pc = 0 [L702] wb_i = 1 [L703] c2_i = wb_i [L704] c1_i = c2_i [L705] wl_i = c1_i [L706] r_i = 0 [L707] c_req_up = 0 [L708] d = 0 [L709] c = 0 [L710] CALL start_simulation() [L400] int kernel_st ; [L403] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L404] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L415] COND TRUE (int )wl_i == 1 [L416] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L420] COND TRUE (int )c1_i == 1 [L421] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L425] COND TRUE (int )c2_i == 1 [L426] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L430] COND TRUE (int )wb_i == 1 [L431] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L435] COND FALSE !((int )r_i == 1) [L438] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L440] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L445] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L450] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L455] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L460] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L465] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L473] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L483] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L492] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L501] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L510] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L515] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L520] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L525] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L530] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L535] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L541] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L544] kernel_st = 1 [L545] CALL eval() [L286] int tmp ; [L287] int tmp___0 ; [L288] int tmp___1 ; [L289] int tmp___2 ; [L290] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L294] COND TRUE 1 [L296] COND TRUE (int )wl_st == 0 [L317] COND TRUE (int )wl_st == 0 [L319] tmp = __VERIFIER_nondet_int() [L321] COND FALSE !(\read(tmp)) [L332] COND TRUE (int )c1_st == 0 [L334] tmp___0 = __VERIFIER_nondet_int() [L336] COND FALSE !(\read(tmp___0)) [L347] COND TRUE (int )c2_st == 0 [L349] tmp___1 = __VERIFIER_nondet_int() [L351] COND FALSE !(\read(tmp___1)) [L362] COND TRUE (int )wb_st == 0 [L364] tmp___2 = __VERIFIER_nondet_int() [L366] COND FALSE !(\read(tmp___2)) [L377] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-15 01:00:31,361 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)