./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c40ed6d21fe4d61cae011269f1fdb95d05149cea0f3470f42c6e8f2fc8fb0d6a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 01:03:36,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 01:03:36,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 01:03:36,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 01:03:36,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 01:03:36,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 01:03:36,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 01:03:36,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 01:03:36,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 01:03:36,241 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 01:03:36,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 01:03:36,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 01:03:36,242 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 01:03:36,242 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 01:03:36,243 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 01:03:36,243 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 01:03:36,243 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 01:03:36,243 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 01:03:36,243 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 01:03:36,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 01:03:36,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 01:03:36,246 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 01:03:36,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 01:03:36,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 01:03:36,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 01:03:36,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 01:03:36,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 01:03:36,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 01:03:36,247 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 01:03:36,247 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 01:03:36,248 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 01:03:36,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 01:03:36,248 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 01:03:36,249 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 01:03:36,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 01:03:36,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 01:03:36,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 01:03:36,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 01:03:36,250 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 01:03:36,250 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-clean/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-clean/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 -> c40ed6d21fe4d61cae011269f1fdb95d05149cea0f3470f42c6e8f2fc8fb0d6a [2024-10-12 01:03:36,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 01:03:36,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 01:03:36,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 01:03:36,487 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 01:03:36,487 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 01:03:36,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c [2024-10-12 01:03:37,695 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 01:03:37,859 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 01:03:37,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c [2024-10-12 01:03:37,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6f53b5fc4/882ebbd266e64e3087d6a176b37e23e8/FLAGb5497793b [2024-10-12 01:03:38,258 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6f53b5fc4/882ebbd266e64e3087d6a176b37e23e8 [2024-10-12 01:03:38,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 01:03:38,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 01:03:38,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 01:03:38,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 01:03:38,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 01:03:38,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f950e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38, skipping insertion in model container [2024-10-12 01:03:38,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 01:03:38,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 01:03:38,506 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 01:03:38,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 01:03:38,587 INFO L204 MainTranslator]: Completed translation [2024-10-12 01:03:38,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38 WrapperNode [2024-10-12 01:03:38,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 01:03:38,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 01:03:38,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 01:03:38,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 01:03:38,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,626 INFO L138 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 369 [2024-10-12 01:03:38,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 01:03:38,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 01:03:38,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 01:03:38,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 01:03:38,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,655 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-12 01:03:38,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,659 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 01:03:38,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 01:03:38,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 01:03:38,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 01:03:38,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:38,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:38,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:38,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 01:03:38,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 01:03:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 01:03:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 01:03:38,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 01:03:38,817 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 01:03:38,819 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 01:03:39,144 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-12 01:03:39,144 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 01:03:39,165 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 01:03:39,165 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-12 01:03:39,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:03:39 BoogieIcfgContainer [2024-10-12 01:03:39,166 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 01:03:39,167 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 01:03:39,167 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 01:03:39,170 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 01:03:39,170 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:03:39,170 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 01:03:38" (1/3) ... [2024-10-12 01:03:39,171 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68673113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 01:03:39, skipping insertion in model container [2024-10-12 01:03:39,172 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:03:39,172 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (2/3) ... [2024-10-12 01:03:39,173 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68673113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 01:03:39, skipping insertion in model container [2024-10-12 01:03:39,173 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:03:39,173 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:03:39" (3/3) ... [2024-10-12 01:03:39,174 INFO L332 chiAutomizerObserver]: Analyzing ICFG toy1.cil.c [2024-10-12 01:03:39,219 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 01:03:39,219 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 01:03:39,220 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 01:03:39,220 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 01:03:39,220 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 01:03:39,220 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 01:03:39,220 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 01:03:39,221 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 01:03:39,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 136 states, 135 states have (on average 1.8074074074074074) internal successors, (244), 135 states have internal predecessors, (244), 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-12 01:03:39,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2024-10-12 01:03:39,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:39,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:39,257 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-12 01:03:39,257 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-12 01:03:39,257 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 01:03:39,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 136 states, 135 states have (on average 1.8074074074074074) internal successors, (244), 135 states have internal predecessors, (244), 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-12 01:03:39,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2024-10-12 01:03:39,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:39,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:39,271 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-12 01:03:39,272 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-12 01:03:39,280 INFO L745 eck$LassoCheckResult]: Stem: 28#$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; 46#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; 19#L416true assume !(1 == ~c_req_up~0); 116#L416-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 64#L427-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 74#L432-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 31#L437-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 45#L442-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 112#L447-1true assume !(0 == ~e_f~0); 34#L452-1true assume !(0 == ~e_g~0); 8#L457-1true assume !(0 == ~e_e~0); 124#L462-1true assume !(0 == ~e_c~0); 23#L467-1true assume !(0 == ~e_wl~0); 103#L472-1true assume !(1 == ~wl_pc~0); 100#$Ultimate##44true assume !(2 == ~wl_pc~0); 95#L485true assume !(1 == ~c1_pc~0); 24#L495true assume !(1 == ~c2_pc~0); 77#L504true assume !(1 == ~wb_pc~0); 99#L513true assume !(1 == ~e_c~0); 15#L522-1true assume !(1 == ~e_e~0); 109#L527-1true assume !(1 == ~e_f~0); 36#L532-1true assume !(1 == ~e_g~0); 85#L537-1true assume !(1 == ~e_c~0); 56#L542-1true assume !(1 == ~e_wl~0); 106#L684-1true [2024-10-12 01:03:39,281 INFO L747 eck$LassoCheckResult]: Loop: 106#L684-1true assume !false; 136#L554true 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; 17#L389true assume !true; 83#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; 22#L560true assume !(1 == ~c_req_up~0); 102#L560-2true start_simulation_~kernel_st~0#1 := 3; 113#L572true assume 0 == ~e_f~0;~e_f~0 := 1; 21#L572-2true assume 0 == ~e_g~0;~e_g~0 := 1; 50#L577-1true assume 0 == ~e_e~0;~e_e~0 := 1; 32#L582-1true assume 0 == ~e_c~0;~e_c~0 := 1; 42#L587-1true assume !(0 == ~e_wl~0); 57#L592-1true assume !(1 == ~wl_pc~0); 41#$Ultimate##257true assume !(2 == ~wl_pc~0); 58#L605true assume !(1 == ~c1_pc~0); 7#L615true assume !(1 == ~c2_pc~0); 47#L624true assume !(1 == ~wb_pc~0); 130#L633true assume 1 == ~e_c~0;~r_st~0 := 0; 89#L642-1true assume 1 == ~e_e~0;~e_e~0 := 2; 25#L647-1true assume 1 == ~e_f~0;~e_f~0 := 2; 10#L652-1true assume 1 == ~e_g~0;~e_g~0 := 2; 90#L657-1true assume 1 == ~e_c~0;~e_c~0 := 2; 81#L662-1true assume !(1 == ~e_wl~0); 107#L667-1true assume 0 == ~wl_st~0; 106#L684-1true [2024-10-12 01:03:39,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:39,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2024-10-12 01:03:39,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:39,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66899881] [2024-10-12 01:03:39,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:39,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:39,524 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-12 01:03:39,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:39,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66899881] [2024-10-12 01:03:39,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66899881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:39,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:39,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:39,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328729566] [2024-10-12 01:03:39,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:39,531 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:39,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:39,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2134822857, now seen corresponding path program 1 times [2024-10-12 01:03:39,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:39,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992219103] [2024-10-12 01:03:39,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:39,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:39,554 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-12 01:03:39,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:39,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992219103] [2024-10-12 01:03:39,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992219103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:39,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:39,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 01:03:39,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395778652] [2024-10-12 01:03:39,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:39,556 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:03:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:39,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 01:03:39,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 01:03:39,592 INFO L87 Difference]: Start difference. First operand has 136 states, 135 states have (on average 1.8074074074074074) internal successors, (244), 135 states have internal predecessors, (244), 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-12 01:03:39,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:39,604 INFO L93 Difference]: Finished difference Result 132 states and 226 transitions. [2024-10-12 01:03:39,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 226 transitions. [2024-10-12 01:03:39,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-10-12 01:03:39,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 126 states and 220 transitions. [2024-10-12 01:03:39,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2024-10-12 01:03:39,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2024-10-12 01:03:39,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 220 transitions. [2024-10-12 01:03:39,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:03:39,632 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 220 transitions. [2024-10-12 01:03:39,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 220 transitions. [2024-10-12 01:03:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-10-12 01:03:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.746031746031746) internal successors, (220), 125 states have internal predecessors, (220), 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-12 01:03:39,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 220 transitions. [2024-10-12 01:03:39,680 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 220 transitions. [2024-10-12 01:03:39,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 01:03:39,688 INFO L425 stractBuchiCegarLoop]: Abstraction has 126 states and 220 transitions. [2024-10-12 01:03:39,688 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 01:03:39,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 220 transitions. [2024-10-12 01:03:39,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-10-12 01:03:39,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:39,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:39,692 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-12 01:03:39,692 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-12 01:03:39,692 INFO L745 eck$LassoCheckResult]: Stem: 329#$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; 330#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; 309#L416 assume !(1 == ~c_req_up~0); 311#L416-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 372#L427-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 373#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 336#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 337#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 356#L447-1 assume !(0 == ~e_f~0); 342#L452-1 assume !(0 == ~e_g~0); 289#L457-1 assume !(0 == ~e_e~0); 290#L462-1 assume !(0 == ~e_c~0); 319#L467-1 assume !(0 == ~e_wl~0); 320#L472-1 assume !(1 == ~wl_pc~0); 395#$Ultimate##44 assume !(2 == ~wl_pc~0); 393#L485 assume !(1 == ~c1_pc~0); 321#L495 assume !(1 == ~c2_pc~0); 323#L504 assume !(1 == ~wb_pc~0); 382#L513 assume !(1 == ~e_c~0); 300#L522-1 assume !(1 == ~e_e~0); 301#L527-1 assume !(1 == ~e_f~0); 343#L532-1 assume !(1 == ~e_g~0); 344#L537-1 assume !(1 == ~e_c~0); 366#L542-1 assume !(1 == ~e_wl~0); 280#L684-1 [2024-10-12 01:03:39,693 INFO L747 eck$LassoCheckResult]: Loop: 280#L684-1 assume !false; 399#L554 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; 305#L389 assume !false; 306#L307 assume !(0 == ~wl_st~0); 361#L311 assume !(0 == ~c1_st~0); 362#L314 assume !(0 == ~c2_st~0); 281#L317 assume !(0 == ~wb_st~0); 283#L320 assume !(0 == ~r_st~0); 386#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; 316#L560 assume !(1 == ~c_req_up~0); 317#L560-2 start_simulation_~kernel_st~0#1 := 3; 397#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 314#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 315#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 338#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 339#L587-1 assume !(0 == ~e_wl~0); 353#L592-1 assume !(1 == ~wl_pc~0); 352#$Ultimate##257 assume !(2 == ~wl_pc~0); 308#L605 assume !(1 == ~c1_pc~0); 286#L615 assume !(1 == ~c2_pc~0); 287#L624 assume !(1 == ~wb_pc~0); 358#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 390#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 324#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 293#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 294#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 387#L662-1 assume !(1 == ~e_wl~0); 388#L667-1 assume 0 == ~wl_st~0; 280#L684-1 [2024-10-12 01:03:39,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:39,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2024-10-12 01:03:39,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:39,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824313700] [2024-10-12 01:03:39,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:39,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:39,757 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-12 01:03:39,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:39,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824313700] [2024-10-12 01:03:39,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824313700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:39,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:39,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:39,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079938010] [2024-10-12 01:03:39,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:39,758 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:39,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:39,759 INFO L85 PathProgramCache]: Analyzing trace with hash -423214340, now seen corresponding path program 1 times [2024-10-12 01:03:39,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:39,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716723994] [2024-10-12 01:03:39,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:39,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:39,788 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-12 01:03:39,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:39,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716723994] [2024-10-12 01:03:39,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716723994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:39,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:39,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 01:03:39,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458274686] [2024-10-12 01:03:39,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:39,789 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:03:39,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:39,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:39,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:39,790 INFO L87 Difference]: Start difference. First operand 126 states and 220 transitions. cyclomatic complexity: 95 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-12 01:03:39,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:39,813 INFO L93 Difference]: Finished difference Result 126 states and 219 transitions. [2024-10-12 01:03:39,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 219 transitions. [2024-10-12 01:03:39,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-10-12 01:03:39,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 219 transitions. [2024-10-12 01:03:39,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2024-10-12 01:03:39,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2024-10-12 01:03:39,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 219 transitions. [2024-10-12 01:03:39,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:03:39,818 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 219 transitions. [2024-10-12 01:03:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 219 transitions. [2024-10-12 01:03:39,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-10-12 01:03:39,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.7380952380952381) internal successors, (219), 125 states have internal predecessors, (219), 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-12 01:03:39,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 219 transitions. [2024-10-12 01:03:39,823 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 219 transitions. [2024-10-12 01:03:39,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:39,824 INFO L425 stractBuchiCegarLoop]: Abstraction has 126 states and 219 transitions. [2024-10-12 01:03:39,824 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 01:03:39,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 219 transitions. [2024-10-12 01:03:39,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-10-12 01:03:39,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:39,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:39,826 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-12 01:03:39,826 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-12 01:03:39,827 INFO L745 eck$LassoCheckResult]: Stem: 588#$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; 589#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; 568#L416 assume !(1 == ~c_req_up~0); 570#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 631#L427-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 632#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 597#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 598#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 615#L447-1 assume !(0 == ~e_f~0); 601#L452-1 assume !(0 == ~e_g~0); 548#L457-1 assume !(0 == ~e_e~0); 549#L462-1 assume !(0 == ~e_c~0); 578#L467-1 assume !(0 == ~e_wl~0); 579#L472-1 assume !(1 == ~wl_pc~0); 654#$Ultimate##44 assume !(2 == ~wl_pc~0); 652#L485 assume !(1 == ~c1_pc~0); 580#L495 assume !(1 == ~c2_pc~0); 582#L504 assume !(1 == ~wb_pc~0); 641#L513 assume !(1 == ~e_c~0); 559#L522-1 assume !(1 == ~e_e~0); 560#L527-1 assume !(1 == ~e_f~0); 602#L532-1 assume !(1 == ~e_g~0); 603#L537-1 assume !(1 == ~e_c~0); 625#L542-1 assume !(1 == ~e_wl~0); 539#L684-1 [2024-10-12 01:03:39,827 INFO L747 eck$LassoCheckResult]: Loop: 539#L684-1 assume !false; 658#L554 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; 564#L389 assume !false; 565#L307 assume !(0 == ~wl_st~0); 620#L311 assume !(0 == ~c1_st~0); 621#L314 assume !(0 == ~c2_st~0); 540#L317 assume !(0 == ~wb_st~0); 542#L320 assume !(0 == ~r_st~0); 645#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; 575#L560 assume !(1 == ~c_req_up~0); 576#L560-2 start_simulation_~kernel_st~0#1 := 3; 656#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 573#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 574#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 595#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 596#L587-1 assume !(0 == ~e_wl~0); 612#L592-1 assume 1 == ~wl_pc~0; 626#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 567#L605 assume !(1 == ~c1_pc~0); 545#L615 assume !(1 == ~c2_pc~0); 546#L624 assume !(1 == ~wb_pc~0); 617#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 649#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 583#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 552#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 553#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 646#L662-1 assume !(1 == ~e_wl~0); 647#L667-1 assume 0 == ~wl_st~0; 539#L684-1 [2024-10-12 01:03:39,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:39,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2024-10-12 01:03:39,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:39,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903957805] [2024-10-12 01:03:39,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:39,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:39,880 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-12 01:03:39,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:39,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903957805] [2024-10-12 01:03:39,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903957805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:39,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:39,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:39,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896066626] [2024-10-12 01:03:39,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:39,883 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:39,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:39,883 INFO L85 PathProgramCache]: Analyzing trace with hash -972474061, now seen corresponding path program 1 times [2024-10-12 01:03:39,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:39,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117403051] [2024-10-12 01:03:39,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:39,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:39,913 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-12 01:03:39,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:39,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117403051] [2024-10-12 01:03:39,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117403051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:39,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:39,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:39,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87741839] [2024-10-12 01:03:39,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:39,915 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:03:39,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:39,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:39,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:39,915 INFO L87 Difference]: Start difference. First operand 126 states and 219 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-12 01:03:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:39,926 INFO L93 Difference]: Finished difference Result 126 states and 218 transitions. [2024-10-12 01:03:39,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 218 transitions. [2024-10-12 01:03:39,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-10-12 01:03:39,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 218 transitions. [2024-10-12 01:03:39,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2024-10-12 01:03:39,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2024-10-12 01:03:39,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 218 transitions. [2024-10-12 01:03:39,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:03:39,933 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 218 transitions. [2024-10-12 01:03:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 218 transitions. [2024-10-12 01:03:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-10-12 01:03:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.7301587301587302) internal successors, (218), 125 states have internal predecessors, (218), 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-12 01:03:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 218 transitions. [2024-10-12 01:03:39,941 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 218 transitions. [2024-10-12 01:03:39,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:39,942 INFO L425 stractBuchiCegarLoop]: Abstraction has 126 states and 218 transitions. [2024-10-12 01:03:39,942 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 01:03:39,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 218 transitions. [2024-10-12 01:03:39,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-10-12 01:03:39,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:39,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:39,945 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-12 01:03:39,945 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-12 01:03:39,945 INFO L745 eck$LassoCheckResult]: Stem: 847#$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; 848#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; 827#L416 assume !(1 == ~c_req_up~0); 829#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 890#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 891#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 856#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 857#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 874#L447-1 assume !(0 == ~e_f~0); 860#L452-1 assume !(0 == ~e_g~0); 807#L457-1 assume !(0 == ~e_e~0); 808#L462-1 assume !(0 == ~e_c~0); 837#L467-1 assume !(0 == ~e_wl~0); 838#L472-1 assume !(1 == ~wl_pc~0); 913#$Ultimate##44 assume !(2 == ~wl_pc~0); 911#L485 assume !(1 == ~c1_pc~0); 839#L495 assume !(1 == ~c2_pc~0); 841#L504 assume !(1 == ~wb_pc~0); 900#L513 assume !(1 == ~e_c~0); 818#L522-1 assume !(1 == ~e_e~0); 819#L527-1 assume !(1 == ~e_f~0); 861#L532-1 assume !(1 == ~e_g~0); 862#L537-1 assume !(1 == ~e_c~0); 884#L542-1 assume !(1 == ~e_wl~0); 798#L684-1 [2024-10-12 01:03:39,945 INFO L747 eck$LassoCheckResult]: Loop: 798#L684-1 assume !false; 917#L554 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; 823#L389 assume !false; 824#L307 assume !(0 == ~wl_st~0); 879#L311 assume !(0 == ~c1_st~0); 880#L314 assume !(0 == ~c2_st~0); 799#L317 assume !(0 == ~wb_st~0); 801#L320 assume !(0 == ~r_st~0); 904#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; 834#L560 assume !(1 == ~c_req_up~0); 835#L560-2 start_simulation_~kernel_st~0#1 := 3; 915#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 832#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 833#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 854#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 855#L587-1 assume !(0 == ~e_wl~0); 871#L592-1 assume 1 == ~wl_pc~0; 885#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 826#L605 assume !(1 == ~c1_pc~0); 804#L615 assume !(1 == ~c2_pc~0); 805#L624 assume !(1 == ~wb_pc~0); 876#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 908#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 842#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 811#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 812#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 905#L662-1 assume !(1 == ~e_wl~0); 906#L667-1 assume 0 == ~wl_st~0; 798#L684-1 [2024-10-12 01:03:39,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:39,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2024-10-12 01:03:39,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:39,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554441817] [2024-10-12 01:03:39,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:39,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:39,974 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-12 01:03:39,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:39,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554441817] [2024-10-12 01:03:39,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554441817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:39,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:39,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:39,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578124887] [2024-10-12 01:03:39,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:39,975 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:39,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:39,975 INFO L85 PathProgramCache]: Analyzing trace with hash -972474061, now seen corresponding path program 2 times [2024-10-12 01:03:39,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:39,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747756813] [2024-10-12 01:03:39,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:39,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:39,999 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-12 01:03:40,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:40,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747756813] [2024-10-12 01:03:40,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747756813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:40,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:40,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:40,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45349890] [2024-10-12 01:03:40,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:40,002 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:03:40,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:40,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:40,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:40,003 INFO L87 Difference]: Start difference. First operand 126 states and 218 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-12 01:03:40,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:40,018 INFO L93 Difference]: Finished difference Result 126 states and 217 transitions. [2024-10-12 01:03:40,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 217 transitions. [2024-10-12 01:03:40,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-10-12 01:03:40,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 217 transitions. [2024-10-12 01:03:40,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2024-10-12 01:03:40,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2024-10-12 01:03:40,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 217 transitions. [2024-10-12 01:03:40,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:03:40,024 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 217 transitions. [2024-10-12 01:03:40,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 217 transitions. [2024-10-12 01:03:40,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-10-12 01:03:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.7222222222222223) internal successors, (217), 125 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-12 01:03:40,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 217 transitions. [2024-10-12 01:03:40,031 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 217 transitions. [2024-10-12 01:03:40,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:40,032 INFO L425 stractBuchiCegarLoop]: Abstraction has 126 states and 217 transitions. [2024-10-12 01:03:40,032 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 01:03:40,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 217 transitions. [2024-10-12 01:03:40,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-10-12 01:03:40,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:40,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:40,034 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-12 01:03:40,034 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-12 01:03:40,034 INFO L745 eck$LassoCheckResult]: Stem: 1106#$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; 1107#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; 1086#L416 assume !(1 == ~c_req_up~0); 1088#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1149#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1150#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1115#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1116#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1133#L447-1 assume !(0 == ~e_f~0); 1119#L452-1 assume !(0 == ~e_g~0); 1066#L457-1 assume !(0 == ~e_e~0); 1067#L462-1 assume !(0 == ~e_c~0); 1096#L467-1 assume !(0 == ~e_wl~0); 1097#L472-1 assume !(1 == ~wl_pc~0); 1172#$Ultimate##44 assume !(2 == ~wl_pc~0); 1170#L485 assume !(1 == ~c1_pc~0); 1098#L495 assume !(1 == ~c2_pc~0); 1100#L504 assume !(1 == ~wb_pc~0); 1159#L513 assume !(1 == ~e_c~0); 1077#L522-1 assume !(1 == ~e_e~0); 1078#L527-1 assume !(1 == ~e_f~0); 1120#L532-1 assume !(1 == ~e_g~0); 1121#L537-1 assume !(1 == ~e_c~0); 1143#L542-1 assume !(1 == ~e_wl~0); 1057#L684-1 [2024-10-12 01:03:40,034 INFO L747 eck$LassoCheckResult]: Loop: 1057#L684-1 assume !false; 1176#L554 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; 1082#L389 assume !false; 1083#L307 assume !(0 == ~wl_st~0); 1138#L311 assume !(0 == ~c1_st~0); 1139#L314 assume !(0 == ~c2_st~0); 1058#L317 assume !(0 == ~wb_st~0); 1060#L320 assume !(0 == ~r_st~0); 1163#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; 1093#L560 assume !(1 == ~c_req_up~0); 1094#L560-2 start_simulation_~kernel_st~0#1 := 3; 1174#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 1091#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1092#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1113#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1114#L587-1 assume !(0 == ~e_wl~0); 1130#L592-1 assume 1 == ~wl_pc~0; 1144#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1085#L605 assume !(1 == ~c1_pc~0); 1063#L615 assume !(1 == ~c2_pc~0); 1064#L624 assume !(1 == ~wb_pc~0); 1135#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 1167#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1101#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1070#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1071#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1164#L662-1 assume !(1 == ~e_wl~0); 1165#L667-1 assume 0 == ~wl_st~0; 1057#L684-1 [2024-10-12 01:03:40,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:40,035 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2024-10-12 01:03:40,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:40,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693479584] [2024-10-12 01:03:40,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:40,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:40,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:40,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:40,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:40,078 INFO L85 PathProgramCache]: Analyzing trace with hash -972474061, now seen corresponding path program 3 times [2024-10-12 01:03:40,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:40,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279774874] [2024-10-12 01:03:40,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:40,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:40,098 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-12 01:03:40,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:40,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279774874] [2024-10-12 01:03:40,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279774874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:40,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:40,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:40,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512222444] [2024-10-12 01:03:40,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:40,100 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:03:40,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:40,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:40,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:40,102 INFO L87 Difference]: Start difference. First operand 126 states and 217 transitions. cyclomatic complexity: 92 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-12 01:03:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:40,155 INFO L93 Difference]: Finished difference Result 230 states and 393 transitions. [2024-10-12 01:03:40,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 393 transitions. [2024-10-12 01:03:40,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 183 [2024-10-12 01:03:40,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 230 states and 393 transitions. [2024-10-12 01:03:40,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 230 [2024-10-12 01:03:40,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 230 [2024-10-12 01:03:40,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 393 transitions. [2024-10-12 01:03:40,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:03:40,159 INFO L218 hiAutomatonCegarLoop]: Abstraction has 230 states and 393 transitions. [2024-10-12 01:03:40,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 393 transitions. [2024-10-12 01:03:40,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2024-10-12 01:03:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 229 states have (on average 1.7117903930131004) internal successors, (392), 228 states have internal predecessors, (392), 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-12 01:03:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 392 transitions. [2024-10-12 01:03:40,170 INFO L240 hiAutomatonCegarLoop]: Abstraction has 229 states and 392 transitions. [2024-10-12 01:03:40,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:40,174 INFO L425 stractBuchiCegarLoop]: Abstraction has 229 states and 392 transitions. [2024-10-12 01:03:40,174 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 01:03:40,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 392 transitions. [2024-10-12 01:03:40,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 182 [2024-10-12 01:03:40,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:40,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:40,176 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-12 01:03:40,177 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-12 01:03:40,178 INFO L745 eck$LassoCheckResult]: Stem: 1470#$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; 1471#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; 1448#L416 assume !(1 == ~c_req_up~0); 1450#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1515#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1516#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1478#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1479#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1498#L447-1 assume !(0 == ~e_f~0); 1484#L452-1 assume !(0 == ~e_g~0); 1428#L457-1 assume !(0 == ~e_e~0); 1429#L462-1 assume !(0 == ~e_c~0); 1459#L467-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1460#L472-1 assume !(1 == ~wl_pc~0); 1540#$Ultimate##44 assume !(2 == ~wl_pc~0); 1538#L485 assume !(1 == ~c1_pc~0); 1462#L495 assume !(1 == ~c2_pc~0); 1464#L504 assume !(1 == ~wb_pc~0); 1526#L513 assume !(1 == ~e_c~0); 1439#L522-1 assume !(1 == ~e_e~0); 1440#L527-1 assume !(1 == ~e_f~0); 1485#L532-1 assume !(1 == ~e_g~0); 1486#L537-1 assume !(1 == ~e_c~0); 1509#L542-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1422#L684-1 [2024-10-12 01:03:40,178 INFO L747 eck$LassoCheckResult]: Loop: 1422#L684-1 assume !false; 1544#L554 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; 1444#L389 assume !false; 1445#L307 assume !(0 == ~wl_st~0); 1504#L311 assume !(0 == ~c1_st~0); 1505#L314 assume !(0 == ~c2_st~0); 1418#L317 assume !(0 == ~wb_st~0); 1420#L320 assume !(0 == ~r_st~0); 1530#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; 1456#L560 assume !(1 == ~c_req_up~0); 1457#L560-2 start_simulation_~kernel_st~0#1 := 3; 1542#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 1454#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1455#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1580#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1578#L587-1 assume !(0 == ~e_wl~0); 1575#L592-1 assume !(1 == ~wl_pc~0); 1571#$Ultimate##257 assume !(2 == ~wl_pc~0); 1567#L605 assume !(1 == ~c1_pc~0); 1562#L615 assume !(1 == ~c2_pc~0); 1560#L624 assume !(1 == ~wb_pc~0); 1557#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 1555#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1553#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1551#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1550#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1549#L662-1 assume !(1 == ~e_wl~0); 1532#L667-1 assume 0 == ~wl_st~0; 1422#L684-1 [2024-10-12 01:03:40,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:40,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2560361, now seen corresponding path program 1 times [2024-10-12 01:03:40,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:40,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104791271] [2024-10-12 01:03:40,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:40,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:40,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-12 01:03:40,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:40,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104791271] [2024-10-12 01:03:40,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104791271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:40,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:40,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 01:03:40,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568803187] [2024-10-12 01:03:40,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:40,239 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:40,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:40,240 INFO L85 PathProgramCache]: Analyzing trace with hash -423214340, now seen corresponding path program 2 times [2024-10-12 01:03:40,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:40,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713512458] [2024-10-12 01:03:40,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:40,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:40,260 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-12 01:03:40,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:40,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713512458] [2024-10-12 01:03:40,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713512458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:40,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:40,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 01:03:40,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862906628] [2024-10-12 01:03:40,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:40,263 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:03:40,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:40,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 01:03:40,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 01:03:40,264 INFO L87 Difference]: Start difference. First operand 229 states and 392 transitions. cyclomatic complexity: 164 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-12 01:03:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:40,363 INFO L93 Difference]: Finished difference Result 473 states and 794 transitions. [2024-10-12 01:03:40,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 473 states and 794 transitions. [2024-10-12 01:03:40,366 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 379 [2024-10-12 01:03:40,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 473 states to 473 states and 794 transitions. [2024-10-12 01:03:40,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 473 [2024-10-12 01:03:40,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 473 [2024-10-12 01:03:40,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 473 states and 794 transitions. [2024-10-12 01:03:40,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:03:40,369 INFO L218 hiAutomatonCegarLoop]: Abstraction has 473 states and 794 transitions. [2024-10-12 01:03:40,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states and 794 transitions. [2024-10-12 01:03:40,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 430. [2024-10-12 01:03:40,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 430 states have (on average 1.6837209302325582) internal successors, (724), 429 states have internal predecessors, (724), 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-12 01:03:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 724 transitions. [2024-10-12 01:03:40,382 INFO L240 hiAutomatonCegarLoop]: Abstraction has 430 states and 724 transitions. [2024-10-12 01:03:40,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 01:03:40,383 INFO L425 stractBuchiCegarLoop]: Abstraction has 430 states and 724 transitions. [2024-10-12 01:03:40,383 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 01:03:40,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 430 states and 724 transitions. [2024-10-12 01:03:40,385 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 378 [2024-10-12 01:03:40,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:40,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:40,385 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-12 01:03:40,386 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-12 01:03:40,386 INFO L745 eck$LassoCheckResult]: Stem: 2181#$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; 2182#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; 2160#L416 assume !(1 == ~c_req_up~0); 2162#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 2228#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 2229#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 2190#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 2191#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 2208#L447-1 assume !(0 == ~e_f~0); 2194#L452-1 assume !(0 == ~e_g~0); 2140#L457-1 assume !(0 == ~e_e~0); 2141#L462-1 assume !(0 == ~e_c~0); 2170#L467-1 assume !(0 == ~e_wl~0); 2171#L472-1 assume !(1 == ~wl_pc~0); 2260#$Ultimate##44 assume !(2 == ~wl_pc~0); 2256#L485 assume !(1 == ~c1_pc~0); 2251#L495 assume !(1 == ~c2_pc~0); 2241#L504 assume !(1 == ~wb_pc~0); 2242#L513 assume !(1 == ~e_c~0); 2151#L522-1 assume !(1 == ~e_e~0); 2152#L527-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2283#L532-1 assume !(1 == ~e_g~0); 2280#L537-1 assume !(1 == ~e_c~0); 2281#L542-1 assume !(1 == ~e_wl~0); 2221#L684-1 [2024-10-12 01:03:40,386 INFO L747 eck$LassoCheckResult]: Loop: 2221#L684-1 assume !false; 2265#L554 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; 2403#L389 assume !false; 2401#L307 assume !(0 == ~wl_st~0); 2399#L311 assume !(0 == ~c1_st~0); 2397#L314 assume !(0 == ~c2_st~0); 2395#L317 assume !(0 == ~wb_st~0); 2391#L320 assume !(0 == ~r_st~0); 2389#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; 2384#L560 assume !(1 == ~c_req_up~0); 2381#L560-2 start_simulation_~kernel_st~0#1 := 3; 2378#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 2376#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 2377#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 2372#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 2373#L587-1 assume !(0 == ~e_wl~0); 2296#L592-1 assume 1 == ~wl_pc~0; 2292#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 2159#L605 assume !(1 == ~c1_pc~0); 2223#L615 assume !(1 == ~c2_pc~0); 2209#L624 assume !(1 == ~wb_pc~0); 2211#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 2253#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 2175#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2144#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 2145#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 2248#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2249#L667-1 assume 0 == ~wl_st~0; 2221#L684-1 [2024-10-12 01:03:40,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:40,386 INFO L85 PathProgramCache]: Analyzing trace with hash 255545497, now seen corresponding path program 1 times [2024-10-12 01:03:40,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:40,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068250120] [2024-10-12 01:03:40,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:40,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:40,417 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-12 01:03:40,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:40,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068250120] [2024-10-12 01:03:40,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068250120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:40,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:40,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 01:03:40,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687960116] [2024-10-12 01:03:40,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:40,418 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:40,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:40,418 INFO L85 PathProgramCache]: Analyzing trace with hash -972474123, now seen corresponding path program 1 times [2024-10-12 01:03:40,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:40,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973540038] [2024-10-12 01:03:40,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:40,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:40,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:40,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:40,773 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:03:40,773 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:03:40,773 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:03:40,773 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:03:40,774 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 01:03:40,774 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:40,774 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:03:40,774 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:03:40,774 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2024-10-12 01:03:40,774 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:03:40,774 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:03:40,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,069 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:03:41,069 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 01:03:41,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:41,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:41,073 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:41,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 01:03:41,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:41,076 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:41,101 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:41,101 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-12 01:03:41,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 01:03:41,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:41,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:41,114 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:41,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 01:03:41,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:41,117 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:41,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 01:03:41,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:41,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:41,145 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:41,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 01:03:41,151 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 01:03:41,151 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:41,176 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 01:03:41,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 01:03:41,187 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:03:41,187 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:03:41,187 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:03:41,187 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:03:41,187 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 01:03:41,187 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:41,187 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:03:41,187 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:03:41,187 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2024-10-12 01:03:41,187 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:03:41,187 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:03:41,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,425 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:03:41,429 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 01:03:41,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:41,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:41,433 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:41,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 01:03:41,435 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-12 01:03:41,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:41,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:41,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:41,446 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 01:03:41,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:41,448 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 01:03:41,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:41,450 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:41,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:41,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:41,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:41,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:41,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 01:03:41,464 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-12 01:03:41,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:41,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:41,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:41,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:41,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:41,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:41,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:41,476 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 01:03:41,478 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 01:03:41,479 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 01:03:41,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:41,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:41,500 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:41,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 01:03:41,502 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 01:03:41,502 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 01:03:41,502 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 01:03:41,502 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2024-10-12 01:03:41,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 01:03:41,514 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 01:03:41,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:41,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 01:03:41,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:03:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:41,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 01:03:41,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:03:41,678 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-12 01:03:41,682 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-12 01:03:41,683 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 430 states and 724 transitions. cyclomatic complexity: 297 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-12 01:03:41,761 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 430 states and 724 transitions. cyclomatic complexity: 297. 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 1467 states and 2452 transitions. Complement of second has 5 states. [2024-10-12 01:03:41,762 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-12 01:03:41,763 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-12 01:03:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2024-10-12 01:03:41,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 380 transitions. Stem has 24 letters. Loop has 28 letters. [2024-10-12 01:03:41,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:41,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 380 transitions. Stem has 52 letters. Loop has 28 letters. [2024-10-12 01:03:41,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:41,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 380 transitions. Stem has 24 letters. Loop has 56 letters. [2024-10-12 01:03:41,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:41,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1467 states and 2452 transitions. [2024-10-12 01:03:41,776 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1009 [2024-10-12 01:03:41,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1467 states to 1467 states and 2452 transitions. [2024-10-12 01:03:41,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1069 [2024-10-12 01:03:41,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1076 [2024-10-12 01:03:41,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1467 states and 2452 transitions. [2024-10-12 01:03:41,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:41,785 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1467 states and 2452 transitions. [2024-10-12 01:03:41,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states and 2452 transitions. [2024-10-12 01:03:41,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1207. [2024-10-12 01:03:41,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1207 states have (on average 1.671913835956918) internal successors, (2018), 1206 states have internal predecessors, (2018), 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-12 01:03:41,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 2018 transitions. [2024-10-12 01:03:41,805 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1207 states and 2018 transitions. [2024-10-12 01:03:41,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:41,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 01:03:41,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 01:03:41,807 INFO L87 Difference]: Start difference. First operand 1207 states and 2018 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-12 01:03:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:41,892 INFO L93 Difference]: Finished difference Result 2357 states and 3868 transitions. [2024-10-12 01:03:41,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2357 states and 3868 transitions. [2024-10-12 01:03:41,921 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1411 [2024-10-12 01:03:41,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2357 states to 2357 states and 3868 transitions. [2024-10-12 01:03:41,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1549 [2024-10-12 01:03:41,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1549 [2024-10-12 01:03:41,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2357 states and 3868 transitions. [2024-10-12 01:03:41,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:41,939 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2357 states and 3868 transitions. [2024-10-12 01:03:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states and 3868 transitions. [2024-10-12 01:03:41,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 01:03:41,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2294. [2024-10-12 01:03:41,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 2294 states have (on average 1.6547515257192678) internal successors, (3796), 2293 states have internal predecessors, (3796), 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-12 01:03:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 3796 transitions. [2024-10-12 01:03:41,983 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2294 states and 3796 transitions. [2024-10-12 01:03:41,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 01:03:41,984 INFO L425 stractBuchiCegarLoop]: Abstraction has 2294 states and 3796 transitions. [2024-10-12 01:03:41,984 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 01:03:41,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2294 states and 3796 transitions. [2024-10-12 01:03:41,991 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1405 [2024-10-12 01:03:41,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:41,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:41,992 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-12 01:03:41,992 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-12 01:03:41,992 INFO L745 eck$LassoCheckResult]: Stem: 7866#$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; 7867#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; 7831#L416 assume !(1 == ~c_req_up~0); 7833#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 7963#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 7964#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 7878#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 7879#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 8046#L447-1 assume !(0 == ~e_f~0); 8047#L452-1 assume !(0 == ~e_g~0); 7793#L457-1 assume !(0 == ~e_e~0); 7794#L462-1 assume 0 == ~e_c~0;~e_c~0 := 1; 8073#L467-1 assume !(0 == ~e_wl~0); 8035#L472-1 assume !(1 == ~wl_pc~0); 8036#$Ultimate##44 assume !(2 == ~wl_pc~0); 8106#L485 assume !(1 == ~c1_pc~0); 8103#L495 assume !(1 == ~c2_pc~0); 8102#L504 assume !(1 == ~wb_pc~0); 8028#L513 assume !(1 == ~e_c~0); 8029#L522-1 assume !(1 == ~e_e~0); 8043#L527-1 assume !(1 == ~e_f~0); 8044#L532-1 assume !(1 == ~e_g~0); 8088#L537-1 assume !(1 == ~e_c~0); 8089#L542-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7945#L684-1 [2024-10-12 01:03:41,993 INFO L747 eck$LassoCheckResult]: Loop: 7945#L684-1 assume !false; 8898#L554 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; 8896#L389 assume !false; 8853#L307 assume !(0 == ~wl_st~0); 8854#L311 assume !(0 == ~c1_st~0); 8846#L314 assume !(0 == ~c2_st~0); 8848#L317 assume !(0 == ~wb_st~0); 9045#L320 assume !(0 == ~r_st~0); 9042#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; 9041#L560 assume !(1 == ~c_req_up~0); 8824#L560-2 start_simulation_~kernel_st~0#1 := 3; 8801#L572 assume !(0 == ~e_f~0); 8802#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 9049#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 9048#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 8815#L587-1 assume !(0 == ~e_wl~0); 8811#L592-1 assume 1 == ~wl_pc~0; 8808#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 8809#L605 assume !(1 == ~c1_pc~0); 8930#L615 assume !(1 == ~c2_pc~0); 8928#L624 assume !(1 == ~wb_pc~0); 8925#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 8923#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 8921#L647-1 assume !(1 == ~e_f~0); 8919#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 8918#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 8913#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 8903#L667-1 assume 0 == ~wl_st~0; 7945#L684-1 [2024-10-12 01:03:41,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:41,993 INFO L85 PathProgramCache]: Analyzing trace with hash 842411091, now seen corresponding path program 1 times [2024-10-12 01:03:41,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:41,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306649692] [2024-10-12 01:03:41,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:41,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:42,040 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-12 01:03:42,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:42,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306649692] [2024-10-12 01:03:42,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306649692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:42,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:42,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 01:03:42,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999894387] [2024-10-12 01:03:42,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:42,041 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:42,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:42,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1735992313, now seen corresponding path program 1 times [2024-10-12 01:03:42,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:42,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916288373] [2024-10-12 01:03:42,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:42,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:42,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:42,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:42,240 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:03:42,240 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:03:42,240 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:03:42,240 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:03:42,240 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 01:03:42,240 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,241 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:03:42,241 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:03:42,241 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration8_Loop [2024-10-12 01:03:42,242 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:03:42,242 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:03:42,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,462 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:03:42,462 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 01:03:42,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:42,464 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:42,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 01:03:42,466 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:42,466 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:42,484 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:42,484 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-12 01:03:42,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:42,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:42,496 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:42,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 01:03:42,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:42,502 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:42,514 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:42,514 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-12 01:03:42,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:42,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:42,527 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:42,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 01:03:42,528 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:42,528 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:42,539 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:42,539 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-12 01:03:42,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:42,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:42,551 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:42,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 01:03:42,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:42,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:42,570 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:42,571 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-12 01:03:42,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:42,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:42,583 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:42,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 01:03:42,584 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:42,584 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:42,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:42,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:42,607 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:42,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 01:03:42,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 01:03:42,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:42,620 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 01:03:42,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 01:03:42,632 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:03:42,632 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:03:42,632 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:03:42,632 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:03:42,632 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 01:03:42,632 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,632 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:03:42,632 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:03:42,632 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration8_Loop [2024-10-12 01:03:42,632 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:03:42,632 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:03:42,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,844 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:03:42,844 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 01:03:42,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:42,845 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:42,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 01:03:42,851 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-12 01:03:42,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:42,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:42,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:42,862 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 01:03:42,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:42,862 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 01:03:42,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:42,864 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:42,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 01:03:42,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:42,876 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:42,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 01:03:42,878 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-12 01:03:42,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:42,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:42,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:42,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:42,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:42,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:42,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:42,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:42,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:42,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:42,901 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:42,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 01:03:42,904 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-12 01:03:42,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:42,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:42,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:42,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:42,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:42,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:42,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:42,915 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:42,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:42,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:42,927 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:42,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 01:03:42,928 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-12 01:03:42,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:42,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:42,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:42,938 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 01:03:42,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:42,939 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 01:03:42,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:42,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:42,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 01:03:42,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:42,952 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:42,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 01:03:42,953 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-12 01:03:42,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:42,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:42,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:42,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:42,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:42,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:42,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:42,965 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 01:03:42,967 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 01:03:42,967 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 01:03:42,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:42,969 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:42,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 01:03:42,993 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 01:03:42,993 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 01:03:42,993 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 01:03:42,993 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2024-10-12 01:03:43,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:43,004 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 01:03:43,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:43,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 01:03:43,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:03:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:43,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 01:03:43,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:03:43,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-12 01:03:43,131 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-12 01:03:43,131 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2294 states and 3796 transitions. cyclomatic complexity: 1518 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-12 01:03:43,166 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2294 states and 3796 transitions. cyclomatic complexity: 1518. 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 3420 states and 5673 transitions. Complement of second has 5 states. [2024-10-12 01:03:43,167 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-12 01:03:43,168 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-12 01:03:43,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2024-10-12 01:03:43,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 377 transitions. Stem has 24 letters. Loop has 28 letters. [2024-10-12 01:03:43,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:43,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 377 transitions. Stem has 52 letters. Loop has 28 letters. [2024-10-12 01:03:43,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:43,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 377 transitions. Stem has 24 letters. Loop has 56 letters. [2024-10-12 01:03:43,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:43,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3420 states and 5673 transitions. [2024-10-12 01:03:43,183 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1999 [2024-10-12 01:03:43,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3420 states to 3420 states and 5673 transitions. [2024-10-12 01:03:43,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2103 [2024-10-12 01:03:43,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2110 [2024-10-12 01:03:43,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3420 states and 5673 transitions. [2024-10-12 01:03:43,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:43,196 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3420 states and 5673 transitions. [2024-10-12 01:03:43,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3420 states and 5673 transitions. [2024-10-12 01:03:43,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3420 to 2078. [2024-10-12 01:03:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2078 states, 2078 states have (on average 1.6544754571703562) internal successors, (3438), 2077 states have internal predecessors, (3438), 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-12 01:03:43,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 3438 transitions. [2024-10-12 01:03:43,226 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2078 states and 3438 transitions. [2024-10-12 01:03:43,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:43,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 01:03:43,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 01:03:43,226 INFO L87 Difference]: Start difference. First operand 2078 states and 3438 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-12 01:03:43,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:43,285 INFO L93 Difference]: Finished difference Result 2143 states and 3497 transitions. [2024-10-12 01:03:43,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2143 states and 3497 transitions. [2024-10-12 01:03:43,293 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1220 [2024-10-12 01:03:43,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2143 states to 2143 states and 3497 transitions. [2024-10-12 01:03:43,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1345 [2024-10-12 01:03:43,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1345 [2024-10-12 01:03:43,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2143 states and 3497 transitions. [2024-10-12 01:03:43,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:43,302 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2143 states and 3497 transitions. [2024-10-12 01:03:43,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states and 3497 transitions. [2024-10-12 01:03:43,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 1973. [2024-10-12 01:03:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1973 states, 1973 states have (on average 1.6426761277242778) internal successors, (3241), 1972 states have internal predecessors, (3241), 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-12 01:03:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 3241 transitions. [2024-10-12 01:03:43,324 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1973 states and 3241 transitions. [2024-10-12 01:03:43,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 01:03:43,324 INFO L425 stractBuchiCegarLoop]: Abstraction has 1973 states and 3241 transitions. [2024-10-12 01:03:43,324 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 01:03:43,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1973 states and 3241 transitions. [2024-10-12 01:03:43,330 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1220 [2024-10-12 01:03:43,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:43,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:43,331 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-12 01:03:43,331 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-12 01:03:43,331 INFO L745 eck$LassoCheckResult]: Stem: 17981#$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; 17982#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; 17948#L416 assume !(1 == ~c_req_up~0); 17950#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 18065#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 18066#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 18084#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 18029#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 18030#L447-1 assume !(0 == ~e_f~0); 18162#L452-1 assume !(0 == ~e_g~0); 17907#L457-1 assume !(0 == ~e_e~0); 17908#L462-1 assume !(0 == ~e_c~0); 18150#L467-1 assume !(0 == ~e_wl~0); 18126#L472-1 assume !(1 == ~wl_pc~0); 18127#$Ultimate##44 assume !(2 == ~wl_pc~0); 18183#L485 assume !(1 == ~c1_pc~0); 18180#L495 assume !(1 == ~c2_pc~0); 18179#L504 assume !(1 == ~wb_pc~0); 18119#L513 assume !(1 == ~e_c~0); 18120#L522-1 assume !(1 == ~e_e~0); 18169#L527-1 assume !(1 == ~e_f~0); 18170#L532-1 assume !(1 == ~e_g~0); 18105#L537-1 assume !(1 == ~e_c~0); 18106#L542-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 18052#L684-1 assume !false; 19485#L554 [2024-10-12 01:03:43,331 INFO L747 eck$LassoCheckResult]: Loop: 19485#L554 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; 19481#L389 assume !false; 19479#L307 assume !(0 == ~wl_st~0); 19477#L311 assume !(0 == ~c1_st~0); 19475#L314 assume !(0 == ~c2_st~0); 19473#L317 assume !(0 == ~wb_st~0); 19469#L320 assume !(0 == ~r_st~0); 19467#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; 19200#L560 assume !(1 == ~c_req_up~0); 19201#L560-2 start_simulation_~kernel_st~0#1 := 3; 19743#L572 assume !(0 == ~e_f~0); 19738#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 19736#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 19734#L582-1 assume !(0 == ~e_c~0); 19732#L587-1 assume !(0 == ~e_wl~0); 19603#L592-1 assume !(1 == ~wl_pc~0); 19729#$Ultimate##257 assume !(2 == ~wl_pc~0); 19726#L605 assume !(1 == ~c1_pc~0); 19721#L615 assume !(1 == ~c2_pc~0); 19720#L624 assume !(1 == ~wb_pc~0); 19696#L633 assume !(1 == ~e_c~0); 19695#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 19694#L647-1 assume !(1 == ~e_f~0); 19693#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 19692#L657-1 assume !(1 == ~e_c~0); 19691#L662-1 assume !(1 == ~e_wl~0); 18098#L667-1 assume 0 == ~wl_st~0; 19496#L684-1 assume !false; 19485#L554 [2024-10-12 01:03:43,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:43,331 INFO L85 PathProgramCache]: Analyzing trace with hash -666177026, now seen corresponding path program 1 times [2024-10-12 01:03:43,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:43,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805094483] [2024-10-12 01:03:43,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:43,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:43,357 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-12 01:03:43,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:43,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805094483] [2024-10-12 01:03:43,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805094483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:43,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:43,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 01:03:43,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581459909] [2024-10-12 01:03:43,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:43,358 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:43,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:43,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1204821088, now seen corresponding path program 1 times [2024-10-12 01:03:43,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:43,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785955237] [2024-10-12 01:03:43,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:43,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:43,376 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-12 01:03:43,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:43,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785955237] [2024-10-12 01:03:43,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785955237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:43,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:43,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:43,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404201269] [2024-10-12 01:03:43,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:43,377 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:03:43,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:43,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 01:03:43,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 01:03:43,377 INFO L87 Difference]: Start difference. First operand 1973 states and 3241 transitions. cyclomatic complexity: 1281 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-12 01:03:43,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:43,428 INFO L93 Difference]: Finished difference Result 1696 states and 2752 transitions. [2024-10-12 01:03:43,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1696 states and 2752 transitions. [2024-10-12 01:03:43,433 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 973 [2024-10-12 01:03:43,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1696 states to 1696 states and 2752 transitions. [2024-10-12 01:03:43,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1038 [2024-10-12 01:03:43,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1038 [2024-10-12 01:03:43,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1696 states and 2752 transitions. [2024-10-12 01:03:43,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:43,439 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1696 states and 2752 transitions. [2024-10-12 01:03:43,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states and 2752 transitions. [2024-10-12 01:03:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1692. [2024-10-12 01:03:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1692 states have (on average 1.624113475177305) internal successors, (2748), 1691 states have internal predecessors, (2748), 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-12 01:03:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 2748 transitions. [2024-10-12 01:03:43,456 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1692 states and 2748 transitions. [2024-10-12 01:03:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 01:03:43,457 INFO L425 stractBuchiCegarLoop]: Abstraction has 1692 states and 2748 transitions. [2024-10-12 01:03:43,457 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 01:03:43,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1692 states and 2748 transitions. [2024-10-12 01:03:43,461 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 973 [2024-10-12 01:03:43,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:43,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:43,462 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-12 01:03:43,462 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-12 01:03:43,462 INFO L745 eck$LassoCheckResult]: Stem: 21663#$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; 21664#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; 21628#L416 assume !(1 == ~c_req_up~0); 21630#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 21828#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 21852#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 21851#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 21710#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 21711#L447-1 assume !(0 == ~e_f~0); 21848#L452-1 assume !(0 == ~e_g~0); 21587#L457-1 assume !(0 == ~e_e~0); 21588#L462-1 assume !(0 == ~e_c~0); 21837#L467-1 assume !(0 == ~e_wl~0); 21808#L472-1 assume !(1 == ~wl_pc~0); 21809#$Ultimate##44 assume !(2 == ~wl_pc~0); 21798#L485 assume !(1 == ~c1_pc~0); 21783#L495 assume !(1 == ~c2_pc~0); 21854#L504 assume !(1 == ~wb_pc~0); 21801#L513 assume !(1 == ~e_c~0); 21614#L522-1 assume !(1 == ~e_e~0); 21615#L527-1 assume !(1 == ~e_f~0); 21849#L532-1 assume !(1 == ~e_g~0); 21785#L537-1 assume !(1 == ~e_c~0); 21732#L542-1 assume !(1 == ~e_wl~0); 21733#L684-1 assume !false; 22135#L554 [2024-10-12 01:03:43,462 INFO L747 eck$LassoCheckResult]: Loop: 22135#L554 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; 22932#L389 assume !false; 22921#L307 assume !(0 == ~wl_st~0); 22922#L311 assume !(0 == ~c1_st~0); 22927#L314 assume !(0 == ~c2_st~0); 22928#L317 assume !(0 == ~wb_st~0); 22923#L320 assume !(0 == ~r_st~0); 22924#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; 23017#L560 assume !(1 == ~c_req_up~0); 23011#L560-2 start_simulation_~kernel_st~0#1 := 3; 23001#L572 assume !(0 == ~e_f~0); 23002#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 22996#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 22997#L582-1 assume !(0 == ~e_c~0); 22992#L587-1 assume !(0 == ~e_wl~0); 22993#L592-1 assume !(1 == ~wl_pc~0); 22988#$Ultimate##257 assume !(2 == ~wl_pc~0); 22986#L605 assume !(1 == ~c1_pc~0); 22985#L615 assume !(1 == ~c2_pc~0); 22980#L624 assume !(1 == ~wb_pc~0); 22978#L633 assume !(1 == ~e_c~0); 22977#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 22976#L647-1 assume !(1 == ~e_f~0); 22975#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 22974#L657-1 assume !(1 == ~e_c~0); 22972#L662-1 assume !(1 == ~e_wl~0); 22973#L667-1 assume 0 == ~wl_st~0; 23023#L684-1 assume !false; 22135#L554 [2024-10-12 01:03:43,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:43,463 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2024-10-12 01:03:43,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:43,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825577949] [2024-10-12 01:03:43,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:43,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:43,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:43,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 01:03:43,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:43,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:43,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1204821088, now seen corresponding path program 2 times [2024-10-12 01:03:43,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:43,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846478111] [2024-10-12 01:03:43,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:43,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:43,508 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-12 01:03:43,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:43,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846478111] [2024-10-12 01:03:43,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846478111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:43,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:43,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:43,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376961679] [2024-10-12 01:03:43,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:43,508 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:03:43,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:43,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:43,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:43,509 INFO L87 Difference]: Start difference. First operand 1692 states and 2748 transitions. cyclomatic complexity: 1068 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-12 01:03:43,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:43,538 INFO L93 Difference]: Finished difference Result 2704 states and 4341 transitions. [2024-10-12 01:03:43,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2704 states and 4341 transitions. [2024-10-12 01:03:43,546 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1569 [2024-10-12 01:03:43,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2704 states to 2704 states and 4341 transitions. [2024-10-12 01:03:43,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1632 [2024-10-12 01:03:43,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1632 [2024-10-12 01:03:43,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2704 states and 4341 transitions. [2024-10-12 01:03:43,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:43,557 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2704 states and 4341 transitions. [2024-10-12 01:03:43,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states and 4341 transitions. [2024-10-12 01:03:43,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2024-10-12 01:03:43,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2704 states have (on average 1.6053994082840237) internal successors, (4341), 2703 states have internal predecessors, (4341), 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-12 01:03:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 4341 transitions. [2024-10-12 01:03:43,593 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2704 states and 4341 transitions. [2024-10-12 01:03:43,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:43,594 INFO L425 stractBuchiCegarLoop]: Abstraction has 2704 states and 4341 transitions. [2024-10-12 01:03:43,594 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 01:03:43,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2704 states and 4341 transitions. [2024-10-12 01:03:43,600 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1569 [2024-10-12 01:03:43,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:43,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:43,602 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-12 01:03:43,602 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, 1] [2024-10-12 01:03:43,602 INFO L745 eck$LassoCheckResult]: Stem: 26070#$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; 26071#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; 26036#L416 assume !(1 == ~c_req_up~0); 26038#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 26257#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 26285#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 26284#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 26116#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 26117#L447-1 assume !(0 == ~e_f~0); 26281#L452-1 assume !(0 == ~e_g~0); 25990#L457-1 assume !(0 == ~e_e~0); 25991#L462-1 assume !(0 == ~e_c~0); 26266#L467-1 assume !(0 == ~e_wl~0); 26235#L472-1 assume !(1 == ~wl_pc~0); 26236#$Ultimate##44 assume !(2 == ~wl_pc~0); 26224#L485 assume !(1 == ~c1_pc~0); 26204#L495 assume !(1 == ~c2_pc~0); 26287#L504 assume !(1 == ~wb_pc~0); 26227#L513 assume !(1 == ~e_c~0); 26018#L522-1 assume !(1 == ~e_e~0); 26019#L527-1 assume !(1 == ~e_f~0); 26282#L532-1 assume !(1 == ~e_g~0); 26207#L537-1 assume !(1 == ~e_c~0); 26140#L542-1 assume !(1 == ~e_wl~0); 26141#L684-1 assume !false; 26604#L554 [2024-10-12 01:03:43,602 INFO L747 eck$LassoCheckResult]: Loop: 26604#L554 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; 28137#L389 assume !false; 27695#L307 assume !(0 == ~wl_st~0); 27696#L311 assume !(0 == ~c1_st~0); 27830#L314 assume !(0 == ~c2_st~0); 27825#L317 assume !(0 == ~wb_st~0); 27826#L320 assume !(0 == ~r_st~0); 28114#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; 28096#L560 assume !(1 == ~c_req_up~0); 28097#L560-2 start_simulation_~kernel_st~0#1 := 3; 28421#L572 assume !(0 == ~e_f~0); 28413#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 28403#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 28402#L582-1 assume !(0 == ~e_c~0); 28401#L587-1 assume !(0 == ~e_wl~0); 28400#L592-1 assume !(1 == ~wl_pc~0); 28398#$Ultimate##257 assume 2 == ~wl_pc~0; 28396#L606 assume 1 == ~e_e~0;~wl_st~0 := 0; 28397#L605 assume !(1 == ~c1_pc~0); 28419#L615 assume !(1 == ~c2_pc~0); 28411#L624 assume !(1 == ~wb_pc~0); 28409#L633 assume !(1 == ~e_c~0); 28408#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 28377#L647-1 assume !(1 == ~e_f~0); 28370#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 28367#L657-1 assume !(1 == ~e_c~0); 28119#L662-1 assume !(1 == ~e_wl~0); 28118#L667-1 assume 0 == ~wl_st~0; 27750#L684-1 assume !false; 26604#L554 [2024-10-12 01:03:43,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:43,603 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 2 times [2024-10-12 01:03:43,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:43,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561675849] [2024-10-12 01:03:43,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:43,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:43,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:43,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:43,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:43,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2054308466, now seen corresponding path program 1 times [2024-10-12 01:03:43,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:43,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102779510] [2024-10-12 01:03:43,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:43,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:43,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:43,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:43,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:43,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1416914637, now seen corresponding path program 1 times [2024-10-12 01:03:43,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:43,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440373280] [2024-10-12 01:03:43,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:43,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:43,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:43,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440373280] [2024-10-12 01:03:43,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440373280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:43,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:43,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:43,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210514316] [2024-10-12 01:03:43,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:43,804 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:03:43,804 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:03:43,804 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:03:43,804 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:03:43,804 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 01:03:43,804 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:43,804 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:03:43,804 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:03:43,804 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration11_Loop [2024-10-12 01:03:43,804 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:03:43,804 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:03:43,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,008 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:03:44,009 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 01:03:44,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:44,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:44,010 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:44,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 01:03:44,015 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:44,015 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:44,031 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:44,031 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-12 01:03:44,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:44,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:44,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:44,048 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:44,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 01:03:44,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:44,050 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:44,066 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:44,066 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-12 01:03:44,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:44,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:44,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:44,080 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:44,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 01:03:44,083 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:44,083 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:44,106 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:44,106 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-12 01:03:44,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-12 01:03:44,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:44,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:44,119 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:44,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:44,121 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:44,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 01:03:44,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:44,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:44,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:44,148 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:44,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 01:03:44,150 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 01:03:44,150 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:44,163 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 01:03:44,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:44,175 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:03:44,175 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:03:44,175 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:03:44,175 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:03:44,175 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 01:03:44,175 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:44,175 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:03:44,175 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:03:44,175 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration11_Loop [2024-10-12 01:03:44,175 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:03:44,175 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:03:44,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,382 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:03:44,382 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 01:03:44,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:44,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:44,383 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:44,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 01:03:44,385 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-12 01:03:44,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:44,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:44,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:44,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:44,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:44,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:44,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:44,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:44,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:44,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:44,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:44,408 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:44,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 01:03:44,410 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-12 01:03:44,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:44,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:44,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:44,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:44,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:44,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:44,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:44,421 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:44,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:44,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:44,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:44,432 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:44,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 01:03:44,433 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-12 01:03:44,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:44,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:44,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:44,443 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 01:03:44,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:44,443 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 01:03:44,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:44,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:44,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-12 01:03:44,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:44,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:44,457 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:44,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 01:03:44,458 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-12 01:03:44,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:44,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:44,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:44,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:44,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:44,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:44,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:44,470 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 01:03:44,471 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 01:03:44,471 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 01:03:44,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:44,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:44,473 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:44,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 01:03:44,474 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 01:03:44,474 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 01:03:44,474 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 01:03:44,474 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2024-10-12 01:03:44,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-12 01:03:44,484 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 01:03:44,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:44,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 01:03:44,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:03:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:44,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 01:03:44,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:03:44,604 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-12 01:03:44,604 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-12 01:03:44,604 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2704 states and 4341 transitions. cyclomatic complexity: 1649 Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:44,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-12 01:03:44,676 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2704 states and 4341 transitions. cyclomatic complexity: 1649. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7241 states and 11630 transitions. Complement of second has 5 states. [2024-10-12 01:03:44,677 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-12 01:03:44,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:44,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions. [2024-10-12 01:03:44,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 205 transitions. Stem has 25 letters. Loop has 29 letters. [2024-10-12 01:03:44,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:44,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 205 transitions. Stem has 54 letters. Loop has 29 letters. [2024-10-12 01:03:44,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:44,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 205 transitions. Stem has 25 letters. Loop has 58 letters. [2024-10-12 01:03:44,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:44,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7241 states and 11630 transitions. [2024-10-12 01:03:44,699 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2875 [2024-10-12 01:03:44,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7241 states to 7241 states and 11630 transitions. [2024-10-12 01:03:44,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2947 [2024-10-12 01:03:44,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2984 [2024-10-12 01:03:44,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7241 states and 11630 transitions. [2024-10-12 01:03:44,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:44,728 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7241 states and 11630 transitions. [2024-10-12 01:03:44,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7241 states and 11630 transitions. [2024-10-12 01:03:44,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7241 to 7204. [2024-10-12 01:03:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7204 states, 7204 states have (on average 1.605774569683509) internal successors, (11568), 7203 states have internal predecessors, (11568), 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-12 01:03:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7204 states to 7204 states and 11568 transitions. [2024-10-12 01:03:44,818 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7204 states and 11568 transitions. [2024-10-12 01:03:44,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:44,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:44,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:44,818 INFO L87 Difference]: Start difference. First operand 7204 states and 11568 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:44,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:44,853 INFO L93 Difference]: Finished difference Result 5713 states and 9151 transitions. [2024-10-12 01:03:44,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5713 states and 9151 transitions. [2024-10-12 01:03:44,866 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2245 [2024-10-12 01:03:44,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5713 states to 5713 states and 9151 transitions. [2024-10-12 01:03:44,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2315 [2024-10-12 01:03:44,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2315 [2024-10-12 01:03:44,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5713 states and 9151 transitions. [2024-10-12 01:03:44,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:44,889 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5713 states and 9151 transitions. [2024-10-12 01:03:44,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5713 states and 9151 transitions. [2024-10-12 01:03:44,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5713 to 5485. [2024-10-12 01:03:44,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5485 states, 5485 states have (on average 1.6030993618960803) internal successors, (8793), 5484 states have internal predecessors, (8793), 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-12 01:03:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5485 states to 5485 states and 8793 transitions. [2024-10-12 01:03:44,953 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5485 states and 8793 transitions. [2024-10-12 01:03:44,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:44,954 INFO L425 stractBuchiCegarLoop]: Abstraction has 5485 states and 8793 transitions. [2024-10-12 01:03:44,954 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-12 01:03:44,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5485 states and 8793 transitions. [2024-10-12 01:03:44,963 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 2167 [2024-10-12 01:03:44,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:44,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:44,964 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-12 01:03:44,964 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:44,964 INFO L745 eck$LassoCheckResult]: Stem: 49105#$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; 49106#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; 49074#L416 assume !(1 == ~c_req_up~0); 49076#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 49293#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 49318#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 49316#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 49160#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 49161#L447-1 assume !(0 == ~e_f~0); 49310#L452-1 assume !(0 == ~e_g~0); 49036#L457-1 assume !(0 == ~e_e~0); 49037#L462-1 assume !(0 == ~e_c~0); 49090#L467-1 assume !(0 == ~e_wl~0); 49091#L472-1 assume !(1 == ~wl_pc~0); 49273#$Ultimate##44 assume !(2 == ~wl_pc~0); 49264#L485 assume !(1 == ~c1_pc~0); 49250#L495 assume !(1 == ~c2_pc~0); 49312#L504 assume !(1 == ~wb_pc~0); 49267#L513 assume !(1 == ~e_c~0); 49056#L522-1 assume !(1 == ~e_e~0); 49057#L527-1 assume !(1 == ~e_f~0); 49314#L532-1 assume !(1 == ~e_g~0); 49253#L537-1 assume !(1 == ~e_c~0); 49254#L542-1 assume !(1 == ~e_wl~0); 50638#L684-1 assume !false; 50639#L554 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; 51995#L389 [2024-10-12 01:03:44,964 INFO L747 eck$LassoCheckResult]: Loop: 51995#L389 assume !false; 53330#L307 assume 0 == ~wl_st~0; 53329#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 49202#L333 assume !(0 != eval_~tmp~0#1); 49203#L329 assume !(0 == ~c1_st~0); 53339#L344 assume !(0 == ~c2_st~0); 53337#L359 assume !(0 == ~wb_st~0); 53331#L374 assume !(0 == ~r_st~0); 51995#L389 [2024-10-12 01:03:44,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:44,965 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2024-10-12 01:03:44,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:44,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969649817] [2024-10-12 01:03:44,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:44,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:44,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:44,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:44,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:44,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1296084100, now seen corresponding path program 1 times [2024-10-12 01:03:44,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:44,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340605109] [2024-10-12 01:03:44,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:44,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:44,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:44,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:44,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:44,987 INFO L85 PathProgramCache]: Analyzing trace with hash 377129596, now seen corresponding path program 1 times [2024-10-12 01:03:44,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:44,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964532238] [2024-10-12 01:03:44,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:44,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:45,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-12 01:03:45,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:45,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964532238] [2024-10-12 01:03:45,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964532238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:45,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:45,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:45,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236516135] [2024-10-12 01:03:45,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:45,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:45,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:45,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:45,050 INFO L87 Difference]: Start difference. First operand 5485 states and 8793 transitions. cyclomatic complexity: 3335 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-12 01:03:45,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:45,085 INFO L93 Difference]: Finished difference Result 8667 states and 13772 transitions. [2024-10-12 01:03:45,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8667 states and 13772 transitions. [2024-10-12 01:03:45,106 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 3460 [2024-10-12 01:03:45,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8667 states to 8667 states and 13772 transitions. [2024-10-12 01:03:45,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3538 [2024-10-12 01:03:45,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3538 [2024-10-12 01:03:45,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8667 states and 13772 transitions. [2024-10-12 01:03:45,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:45,125 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8667 states and 13772 transitions. [2024-10-12 01:03:45,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8667 states and 13772 transitions. [2024-10-12 01:03:45,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8667 to 8667. [2024-10-12 01:03:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8667 states, 8667 states have (on average 1.589015807084343) internal successors, (13772), 8666 states have internal predecessors, (13772), 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-12 01:03:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8667 states to 8667 states and 13772 transitions. [2024-10-12 01:03:45,206 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8667 states and 13772 transitions. [2024-10-12 01:03:45,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:45,206 INFO L425 stractBuchiCegarLoop]: Abstraction has 8667 states and 13772 transitions. [2024-10-12 01:03:45,207 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-12 01:03:45,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8667 states and 13772 transitions. [2024-10-12 01:03:45,222 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 3460 [2024-10-12 01:03:45,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:45,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:45,223 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-12 01:03:45,223 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:45,223 INFO L745 eck$LassoCheckResult]: Stem: 63267#$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; 63268#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; 63234#L416 assume !(1 == ~c_req_up~0); 63236#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 63449#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 63482#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 63480#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 63319#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 63320#L447-1 assume !(0 == ~e_f~0); 63474#L452-1 assume !(0 == ~e_g~0); 63195#L457-1 assume !(0 == ~e_e~0); 63196#L462-1 assume !(0 == ~e_c~0); 63251#L467-1 assume !(0 == ~e_wl~0); 63252#L472-1 assume !(1 == ~wl_pc~0); 63430#$Ultimate##44 assume !(2 == ~wl_pc~0); 63420#L485 assume !(1 == ~c1_pc~0); 63406#L495 assume !(1 == ~c2_pc~0); 63476#L504 assume !(1 == ~wb_pc~0); 63424#L513 assume !(1 == ~e_c~0); 63216#L522-1 assume !(1 == ~e_e~0); 63217#L527-1 assume !(1 == ~e_f~0); 63478#L532-1 assume !(1 == ~e_g~0); 63407#L537-1 assume !(1 == ~e_c~0); 63344#L542-1 assume !(1 == ~e_wl~0); 63345#L684-1 assume !false; 65281#L554 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; 68123#L389 [2024-10-12 01:03:45,223 INFO L747 eck$LassoCheckResult]: Loop: 68123#L389 assume !false; 69892#L307 assume 0 == ~wl_st~0; 69891#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 69887#L333 assume !(0 != eval_~tmp~0#1); 69888#L329 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 70175#L348 assume !(0 != eval_~tmp___0~0#1); 70170#L344 assume !(0 == ~c2_st~0); 70154#L359 assume !(0 == ~wb_st~0); 69894#L374 assume !(0 == ~r_st~0); 68123#L389 [2024-10-12 01:03:45,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2024-10-12 01:03:45,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344914852] [2024-10-12 01:03:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:45,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:45,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:45,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1472174914, now seen corresponding path program 1 times [2024-10-12 01:03:45,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309752439] [2024-10-12 01:03:45,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:45,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:45,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:45,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1245610934, now seen corresponding path program 1 times [2024-10-12 01:03:45,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503163931] [2024-10-12 01:03:45,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:45,274 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-12 01:03:45,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:45,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503163931] [2024-10-12 01:03:45,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503163931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:45,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:45,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:45,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194304963] [2024-10-12 01:03:45,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:45,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:45,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:45,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:45,299 INFO L87 Difference]: Start difference. First operand 8667 states and 13772 transitions. cyclomatic complexity: 5132 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-12 01:03:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:45,354 INFO L93 Difference]: Finished difference Result 13738 states and 21493 transitions. [2024-10-12 01:03:45,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13738 states and 21493 transitions. [2024-10-12 01:03:45,438 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5512 [2024-10-12 01:03:45,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13738 states to 13738 states and 21493 transitions. [2024-10-12 01:03:45,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5656 [2024-10-12 01:03:45,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5656 [2024-10-12 01:03:45,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13738 states and 21493 transitions. [2024-10-12 01:03:45,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:45,471 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13738 states and 21493 transitions. [2024-10-12 01:03:45,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13738 states and 21493 transitions. [2024-10-12 01:03:45,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13738 to 13738. [2024-10-12 01:03:45,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13738 states, 13738 states have (on average 1.5644926481292765) internal successors, (21493), 13737 states have internal predecessors, (21493), 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-12 01:03:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13738 states to 13738 states and 21493 transitions. [2024-10-12 01:03:45,606 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13738 states and 21493 transitions. [2024-10-12 01:03:45,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:45,608 INFO L425 stractBuchiCegarLoop]: Abstraction has 13738 states and 21493 transitions. [2024-10-12 01:03:45,608 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-12 01:03:45,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13738 states and 21493 transitions. [2024-10-12 01:03:45,634 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5512 [2024-10-12 01:03:45,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:45,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:45,635 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-12 01:03:45,635 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:45,635 INFO L745 eck$LassoCheckResult]: Stem: 85680#$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; 85681#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; 85648#L416 assume !(1 == ~c_req_up~0); 85650#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 85778#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 85779#L432-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 85909#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 87974#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 87973#L447-1 assume !(0 == ~e_f~0); 87972#L452-1 assume !(0 == ~e_g~0); 87971#L457-1 assume !(0 == ~e_e~0); 87970#L462-1 assume !(0 == ~e_c~0); 87969#L467-1 assume !(0 == ~e_wl~0); 87968#L472-1 assume !(1 == ~wl_pc~0); 87965#$Ultimate##44 assume !(2 == ~wl_pc~0); 87964#L485 assume !(1 == ~c1_pc~0); 87962#L495 assume !(1 == ~c2_pc~0); 87960#L504 assume !(1 == ~wb_pc~0); 87958#L513 assume !(1 == ~e_c~0); 87957#L522-1 assume !(1 == ~e_e~0); 87956#L527-1 assume !(1 == ~e_f~0); 87955#L532-1 assume !(1 == ~e_g~0); 87952#L537-1 assume !(1 == ~e_c~0); 87951#L542-1 assume !(1 == ~e_wl~0); 87945#L684-1 assume !false; 87946#L554 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; 92894#L389 [2024-10-12 01:03:45,636 INFO L747 eck$LassoCheckResult]: Loop: 92894#L389 assume !false; 96096#L307 assume 0 == ~wl_st~0; 96094#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 96092#L333 assume !(0 != eval_~tmp~0#1); 96091#L329 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 96067#L348 assume !(0 != eval_~tmp___0~0#1); 96090#L344 assume !(0 == ~c2_st~0); 96103#L359 assume !(0 == ~wb_st~0); 96097#L374 assume !(0 == ~r_st~0); 92894#L389 [2024-10-12 01:03:45,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2024-10-12 01:03:45,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193489004] [2024-10-12 01:03:45,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:45,659 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-12 01:03:45,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:45,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193489004] [2024-10-12 01:03:45,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193489004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:45,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:45,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:45,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490694451] [2024-10-12 01:03:45,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:45,660 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:45,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1472174914, now seen corresponding path program 2 times [2024-10-12 01:03:45,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342753473] [2024-10-12 01:03:45,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:45,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:45,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:45,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:45,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:45,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:45,740 INFO L87 Difference]: Start difference. First operand 13738 states and 21493 transitions. cyclomatic complexity: 7782 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-12 01:03:45,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:45,778 INFO L93 Difference]: Finished difference Result 13686 states and 21406 transitions. [2024-10-12 01:03:45,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13686 states and 21406 transitions. [2024-10-12 01:03:45,824 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5512 [2024-10-12 01:03:45,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13686 states to 13686 states and 21406 transitions. [2024-10-12 01:03:45,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5606 [2024-10-12 01:03:45,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5606 [2024-10-12 01:03:45,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13686 states and 21406 transitions. [2024-10-12 01:03:45,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:45,868 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13686 states and 21406 transitions. [2024-10-12 01:03:45,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13686 states and 21406 transitions. [2024-10-12 01:03:45,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13686 to 13686. [2024-10-12 01:03:45,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13686 states, 13686 states have (on average 1.5640800818354523) internal successors, (21406), 13685 states have internal predecessors, (21406), 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-12 01:03:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13686 states to 13686 states and 21406 transitions. [2024-10-12 01:03:46,008 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13686 states and 21406 transitions. [2024-10-12 01:03:46,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:46,008 INFO L425 stractBuchiCegarLoop]: Abstraction has 13686 states and 21406 transitions. [2024-10-12 01:03:46,008 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-12 01:03:46,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13686 states and 21406 transitions. [2024-10-12 01:03:46,082 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5512 [2024-10-12 01:03:46,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:46,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:46,083 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-12 01:03:46,083 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:46,083 INFO L745 eck$LassoCheckResult]: Stem: 113107#$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; 113108#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; 113076#L416 assume !(1 == ~c_req_up~0); 113078#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 113287#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 113318#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 113316#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 113157#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 113158#L447-1 assume !(0 == ~e_f~0); 113310#L452-1 assume !(0 == ~e_g~0); 113038#L457-1 assume !(0 == ~e_e~0); 113039#L462-1 assume !(0 == ~e_c~0); 113092#L467-1 assume !(0 == ~e_wl~0); 113093#L472-1 assume !(1 == ~wl_pc~0); 113269#$Ultimate##44 assume !(2 == ~wl_pc~0); 113260#L485 assume !(1 == ~c1_pc~0); 113243#L495 assume !(1 == ~c2_pc~0); 113312#L504 assume !(1 == ~wb_pc~0); 113263#L513 assume !(1 == ~e_c~0); 113058#L522-1 assume !(1 == ~e_e~0); 113059#L527-1 assume !(1 == ~e_f~0); 113314#L532-1 assume !(1 == ~e_g~0); 113246#L537-1 assume !(1 == ~e_c~0); 113247#L542-1 assume !(1 == ~e_wl~0); 115276#L684-1 assume !false; 115277#L554 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; 120536#L389 [2024-10-12 01:03:46,084 INFO L747 eck$LassoCheckResult]: Loop: 120536#L389 assume !false; 124841#L307 assume 0 == ~wl_st~0; 124840#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 124838#L333 assume !(0 != eval_~tmp~0#1); 124839#L329 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 123207#L348 assume !(0 != eval_~tmp___0~0#1); 123209#L344 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 123204#L363 assume !(0 != eval_~tmp___1~0#1); 123205#L359 assume !(0 == ~wb_st~0); 124843#L374 assume !(0 == ~r_st~0); 120536#L389 [2024-10-12 01:03:46,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,084 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2024-10-12 01:03:46,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079567204] [2024-10-12 01:03:46,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:46,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1608868656, now seen corresponding path program 1 times [2024-10-12 01:03:46,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017862660] [2024-10-12 01:03:46,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:46,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,099 INFO L85 PathProgramCache]: Analyzing trace with hash 39115976, now seen corresponding path program 1 times [2024-10-12 01:03:46,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018424263] [2024-10-12 01:03:46,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:46,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-12 01:03:46,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:46,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018424263] [2024-10-12 01:03:46,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018424263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:46,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:46,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:46,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691016613] [2024-10-12 01:03:46,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:46,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:46,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:46,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:46,161 INFO L87 Difference]: Start difference. First operand 13686 states and 21406 transitions. cyclomatic complexity: 7747 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-12 01:03:46,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:46,226 INFO L93 Difference]: Finished difference Result 23373 states and 36086 transitions. [2024-10-12 01:03:46,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23373 states and 36086 transitions. [2024-10-12 01:03:46,297 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 9446 [2024-10-12 01:03:46,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23373 states to 23373 states and 36086 transitions. [2024-10-12 01:03:46,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9572 [2024-10-12 01:03:46,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9572 [2024-10-12 01:03:46,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23373 states and 36086 transitions. [2024-10-12 01:03:46,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:46,491 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23373 states and 36086 transitions. [2024-10-12 01:03:46,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23373 states and 36086 transitions. [2024-10-12 01:03:46,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23373 to 23373. [2024-10-12 01:03:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23373 states, 23373 states have (on average 1.5439181962093014) internal successors, (36086), 23372 states have internal predecessors, (36086), 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-12 01:03:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23373 states to 23373 states and 36086 transitions. [2024-10-12 01:03:46,784 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23373 states and 36086 transitions. [2024-10-12 01:03:46,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:46,785 INFO L425 stractBuchiCegarLoop]: Abstraction has 23373 states and 36086 transitions. [2024-10-12 01:03:46,785 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-10-12 01:03:46,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23373 states and 36086 transitions. [2024-10-12 01:03:46,916 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 9446 [2024-10-12 01:03:46,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:46,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:46,917 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-12 01:03:46,917 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:46,917 INFO L745 eck$LassoCheckResult]: Stem: 150181#$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; 150182#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; 150148#L416 assume !(1 == ~c_req_up~0); 150150#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 150382#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 150416#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 150415#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 150230#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 150231#L447-1 assume !(0 == ~e_f~0); 150412#L452-1 assume !(0 == ~e_g~0); 150103#L457-1 assume !(0 == ~e_e~0); 150104#L462-1 assume !(0 == ~e_c~0); 150395#L467-1 assume !(0 == ~e_wl~0); 150360#L472-1 assume !(1 == ~wl_pc~0); 150361#$Ultimate##44 assume !(2 == ~wl_pc~0); 150351#L485 assume !(1 == ~c1_pc~0); 150328#L495 assume !(1 == ~c2_pc~0); 150418#L504 assume !(1 == ~wb_pc~0); 150354#L513 assume !(1 == ~e_c~0); 150132#L522-1 assume !(1 == ~e_e~0); 150133#L527-1 assume !(1 == ~e_f~0); 150413#L532-1 assume !(1 == ~e_g~0); 150331#L537-1 assume !(1 == ~e_c~0); 150256#L542-1 assume !(1 == ~e_wl~0); 150257#L684-1 assume !false; 154799#L554 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; 166401#L389 [2024-10-12 01:03:46,917 INFO L747 eck$LassoCheckResult]: Loop: 166401#L389 assume !false; 169488#L307 assume 0 == ~wl_st~0; 169487#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 169485#L333 assume !(0 != eval_~tmp~0#1); 169484#L329 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 169442#L348 assume !(0 != eval_~tmp___0~0#1); 167167#L344 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 167162#L363 assume !(0 != eval_~tmp___1~0#1); 167161#L359 assume 0 == ~wb_st~0;havoc eval_#t~nondet7#1;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 167143#L378 assume !(0 != eval_~tmp___2~0#1); 167159#L374 assume !(0 == ~r_st~0); 166401#L389 [2024-10-12 01:03:46,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,918 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2024-10-12 01:03:46,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559401686] [2024-10-12 01:03:46,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:46,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1664643830, now seen corresponding path program 1 times [2024-10-12 01:03:46,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719749315] [2024-10-12 01:03:46,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:46,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1212559870, now seen corresponding path program 1 times [2024-10-12 01:03:46,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723026895] [2024-10-12 01:03:46,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:47,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:47,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 01:03:47 BoogieIcfgContainer [2024-10-12 01:03:47,867 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 01:03:47,867 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 01:03:47,867 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 01:03:47,867 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 01:03:47,868 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:03:39" (3/4) ... [2024-10-12 01:03:47,869 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-12 01:03:47,921 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 01:03:47,922 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 01:03:47,922 INFO L158 Benchmark]: Toolchain (without parser) took 9660.50ms. Allocated memory was 163.6MB in the beginning and 650.1MB in the end (delta: 486.5MB). Free memory was 92.9MB in the beginning and 518.1MB in the end (delta: -425.2MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2024-10-12 01:03:47,922 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 163.6MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 01:03:47,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.02ms. Allocated memory is still 163.6MB. Free memory was 92.8MB in the beginning and 132.5MB in the end (delta: -39.7MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-10-12 01:03:47,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.55ms. Allocated memory is still 163.6MB. Free memory was 132.4MB in the beginning and 133.4MB in the end (delta: -957.5kB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2024-10-12 01:03:47,923 INFO L158 Benchmark]: Boogie Preprocessor took 43.48ms. Allocated memory is still 163.6MB. Free memory was 133.4MB in the beginning and 131.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 01:03:47,923 INFO L158 Benchmark]: RCFGBuilder took 492.35ms. Allocated memory is still 163.6MB. Free memory was 130.3MB in the beginning and 103.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-12 01:03:47,923 INFO L158 Benchmark]: BuchiAutomizer took 8700.05ms. Allocated memory was 163.6MB in the beginning and 650.1MB in the end (delta: 486.5MB). Free memory was 103.0MB in the beginning and 525.4MB in the end (delta: -422.4MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. [2024-10-12 01:03:47,923 INFO L158 Benchmark]: Witness Printer took 54.72ms. Allocated memory is still 650.1MB. Free memory was 524.4MB in the beginning and 518.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 01:03:47,924 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.10ms. Allocated memory is still 163.6MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.02ms. Allocated memory is still 163.6MB. Free memory was 92.8MB in the beginning and 132.5MB in the end (delta: -39.7MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.55ms. Allocated memory is still 163.6MB. Free memory was 132.4MB in the beginning and 133.4MB in the end (delta: -957.5kB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.48ms. Allocated memory is still 163.6MB. Free memory was 133.4MB in the beginning and 131.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 492.35ms. Allocated memory is still 163.6MB. Free memory was 130.3MB in the beginning and 103.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 8700.05ms. Allocated memory was 163.6MB in the beginning and 650.1MB in the end (delta: 486.5MB). Free memory was 103.0MB in the beginning and 525.4MB in the end (delta: -422.4MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. * Witness Printer took 54.72ms. Allocated memory is still 650.1MB. Free memory was 524.4MB in the beginning and 518.1MB 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 18 terminating modules (15 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. 15 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 23373 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.5s and 16 iterations. TraceHistogramMax:1. Analysis of lassos took 5.0s. Construction of modules took 0.3s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 12. Automata minimization 1.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 2148 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.1s. 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, 4438 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4435 mSDsluCounter, 7483 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2765 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 364 IncrementalHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 4718 mSDtfsCounter, 364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT1 SILN1 SILU0 SILI6 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital78 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq182 hnf98 smp100 dnf156 smp82 tf109 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms 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: 306]: 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] [L701] int __retres1 ; [L705] e_wl = 2 [L706] e_c = e_wl [L707] e_g = e_c [L708] e_f = e_g [L709] e_e = e_f [L710] wl_pc = 0 [L711] c1_pc = 0 [L712] c2_pc = 0 [L713] wb_pc = 0 [L714] wb_i = 1 [L715] c2_i = wb_i [L716] c1_i = c2_i [L717] wl_i = c1_i [L718] r_i = 0 [L719] c_req_up = 0 [L720] d = 0 [L721] c = 0 [L722] CALL start_simulation() [L412] int kernel_st ; [L415] 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] [L416] 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] [L427] COND TRUE (int )wl_i == 1 [L428] 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] [L432] COND TRUE (int )c1_i == 1 [L433] 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] [L437] COND TRUE (int )c2_i == 1 [L438] 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] [L442] COND TRUE (int )wb_i == 1 [L443] 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] [L447] COND FALSE !((int )r_i == 1) [L450] 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] [L452] 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] [L457] 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] [L462] 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] [L467] 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] [L472] 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] [L477] 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] [L485] 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] [L495] 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] [L504] 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] [L513] 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] [L522] 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] [L527] 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] [L532] 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] [L537] 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] [L542] 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] [L547] 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] [L553] 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] [L556] kernel_st = 1 [L557] CALL eval() [L298] int tmp ; [L299] int tmp___0 ; [L300] int tmp___1 ; [L301] int tmp___2 ; [L302] 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: [L306] COND TRUE 1 [L308] COND TRUE (int )wl_st == 0 [L329] COND TRUE (int )wl_st == 0 [L331] tmp = __VERIFIER_nondet_int() [L333] COND FALSE !(\read(tmp)) [L344] COND TRUE (int )c1_st == 0 [L346] tmp___0 = __VERIFIER_nondet_int() [L348] COND FALSE !(\read(tmp___0)) [L359] COND TRUE (int )c2_st == 0 [L361] tmp___1 = __VERIFIER_nondet_int() [L363] COND FALSE !(\read(tmp___1)) [L374] COND TRUE (int )wb_st == 0 [L376] tmp___2 = __VERIFIER_nondet_int() [L378] COND FALSE !(\read(tmp___2)) [L389] COND FALSE !((int )r_st == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 306]: 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] [L701] int __retres1 ; [L705] e_wl = 2 [L706] e_c = e_wl [L707] e_g = e_c [L708] e_f = e_g [L709] e_e = e_f [L710] wl_pc = 0 [L711] c1_pc = 0 [L712] c2_pc = 0 [L713] wb_pc = 0 [L714] wb_i = 1 [L715] c2_i = wb_i [L716] c1_i = c2_i [L717] wl_i = c1_i [L718] r_i = 0 [L719] c_req_up = 0 [L720] d = 0 [L721] c = 0 [L722] CALL start_simulation() [L412] int kernel_st ; [L415] 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] [L416] 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] [L427] COND TRUE (int )wl_i == 1 [L428] 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] [L432] COND TRUE (int )c1_i == 1 [L433] 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] [L437] COND TRUE (int )c2_i == 1 [L438] 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] [L442] COND TRUE (int )wb_i == 1 [L443] 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] [L447] COND FALSE !((int )r_i == 1) [L450] 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] [L452] 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] [L457] 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] [L462] 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] [L467] 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] [L472] 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] [L477] 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] [L485] 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] [L495] 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] [L504] 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] [L513] 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] [L522] 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] [L527] 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] [L532] 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] [L537] 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] [L542] 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] [L547] 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] [L553] 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] [L556] kernel_st = 1 [L557] CALL eval() [L298] int tmp ; [L299] int tmp___0 ; [L300] int tmp___1 ; [L301] int tmp___2 ; [L302] 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: [L306] COND TRUE 1 [L308] COND TRUE (int )wl_st == 0 [L329] COND TRUE (int )wl_st == 0 [L331] tmp = __VERIFIER_nondet_int() [L333] COND FALSE !(\read(tmp)) [L344] COND TRUE (int )c1_st == 0 [L346] tmp___0 = __VERIFIER_nondet_int() [L348] COND FALSE !(\read(tmp___0)) [L359] COND TRUE (int )c2_st == 0 [L361] tmp___1 = __VERIFIER_nondet_int() [L363] COND FALSE !(\read(tmp___1)) [L374] COND TRUE (int )wb_st == 0 [L376] tmp___2 = __VERIFIER_nondet_int() [L378] COND FALSE !(\read(tmp___2)) [L389] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-12 01:03:47,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)