./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 01:01:32,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 01:01:32,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-15 01:01:32,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 01:01:32,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 01:01:32,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 01:01:32,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 01:01:32,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 01:01:32,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 01:01:32,212 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 01:01:32,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 01:01:32,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 01:01:32,213 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 01:01:32,213 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 01:01:32,214 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 01:01:32,214 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 01:01:32,214 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 01:01:32,214 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 01:01:32,215 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 01:01:32,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 01:01:32,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 01:01:32,216 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 01:01:32,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 01:01:32,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 01:01:32,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 01:01:32,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 01:01:32,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 01:01:32,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 01:01:32,218 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 01:01:32,218 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 01:01:32,218 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 01:01:32,219 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 01:01:32,219 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 01:01:32,219 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 01:01:32,219 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 01:01:32,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 01:01:32,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 01:01:32,220 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 01:01:32,221 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 01:01:32,221 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 [2024-10-15 01:01:32,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 01:01:32,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 01:01:32,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 01:01:32,465 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 01:01:32,466 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 01:01:32,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2024-10-15 01:01:33,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 01:01:34,280 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 01:01:34,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2024-10-15 01:01:34,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2495c2b78/c1d3a3e2b8f942879eb677b3e7c6b95f/FLAG10bfb224d [2024-10-15 01:01:34,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2495c2b78/c1d3a3e2b8f942879eb677b3e7c6b95f [2024-10-15 01:01:34,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 01:01:34,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 01:01:34,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 01:01:34,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 01:01:34,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 01:01:34,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:01:34" (1/1) ... [2024-10-15 01:01:34,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c2ded8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:34, skipping insertion in model container [2024-10-15 01:01:34,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:01:34" (1/1) ... [2024-10-15 01:01:34,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 01:01:34,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 01:01:34,560 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 01:01:34,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 01:01:34,622 INFO L204 MainTranslator]: Completed translation [2024-10-15 01:01:34,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:34 WrapperNode [2024-10-15 01:01:34,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 01:01:34,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 01:01:34,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 01:01:34,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 01:01:34,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:34" (1/1) ... [2024-10-15 01:01:34,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:34" (1/1) ... [2024-10-15 01:01:34,686 INFO L138 Inliner]: procedures = 21, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 421 [2024-10-15 01:01:34,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 01:01:34,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 01:01:34,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 01:01:34,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 01:01:34,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:34" (1/1) ... [2024-10-15 01:01:34,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:34" (1/1) ... [2024-10-15 01:01:34,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:34" (1/1) ... [2024-10-15 01:01:34,717 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-15 01:01:34,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:34" (1/1) ... [2024-10-15 01:01:34,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:34" (1/1) ... [2024-10-15 01:01:34,723 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:34" (1/1) ... [2024-10-15 01:01:34,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:34" (1/1) ... [2024-10-15 01:01:34,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:34" (1/1) ... [2024-10-15 01:01:34,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:34" (1/1) ... [2024-10-15 01:01:34,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 01:01:34,736 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 01:01:34,736 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 01:01:34,736 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 01:01:34,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:34" (1/1) ... [2024-10-15 01:01:34,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:34,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:01:34,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 01:01:34,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-15 01:01:34,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 01:01:34,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 01:01:34,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 01:01:34,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 01:01:34,893 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 01:01:34,895 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 01:01:35,286 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-10-15 01:01:35,286 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 01:01:35,304 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 01:01:35,305 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-15 01:01:35,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:01:35 BoogieIcfgContainer [2024-10-15 01:01:35,305 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 01:01:35,306 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 01:01:35,306 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 01:01:35,309 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 01:01:35,310 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 01:01:35,310 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 01:01:34" (1/3) ... [2024-10-15 01:01:35,311 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6bb62d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 01:01:35, skipping insertion in model container [2024-10-15 01:01:35,311 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 01:01:35,312 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:34" (2/3) ... [2024-10-15 01:01:35,313 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6bb62d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 01:01:35, skipping insertion in model container [2024-10-15 01:01:35,313 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 01:01:35,313 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:01:35" (3/3) ... [2024-10-15 01:01:35,314 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2024-10-15 01:01:35,359 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 01:01:35,360 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 01:01:35,360 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 01:01:35,360 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 01:01:35,360 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 01:01:35,360 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 01:01:35,360 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 01:01:35,361 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 01:01:35,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 113 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 112 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 01:01:35,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2024-10-15 01:01:35,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:01:35,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:01:35,391 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] [2024-10-15 01:01:35,392 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:01:35,392 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 01:01:35,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 113 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 112 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 01:01:35,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2024-10-15 01:01:35,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:01:35,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:01:35,399 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] [2024-10-15 01:01:35,399 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:01:35,406 INFO L745 eck$LassoCheckResult]: Stem: 32#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 37#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_#t~post33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 82#L228true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 40#L231-1true init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 29#L241true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 26#L244-1true init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 49#L254true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 53#L257-1true init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 23#L267true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 15#L270-1true init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 91#L280true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 71#L283-1true init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 103#L293true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 69#L296-1true init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 111#L306true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 100#L306-1true init_#res#1 := init_~tmp___5~0#1; 88#init_returnLabel#1true main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1; 92#L485true assume !(0 == main_~i2~0#1); 6#L485-2true ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 45#L499-2true [2024-10-15 01:01:35,407 INFO L747 eck$LassoCheckResult]: Loop: 45#L499-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true; 59#L75true assume !(0 != ~mode1~0 % 256); 55#L100true assume !(~r1~0 < 2); 73#L100-1true ~mode1~0 := 1; 101#L75-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 90#L118true assume !(0 != ~mode2~0 % 256); 94#L143true assume !(~r2~0 < 2); 83#L143-1true ~mode2~0 := 1; 56#L118-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 14#L161true assume !(0 != ~mode3~0 % 256); 63#L186true assume !(~r3~0 < 2); 24#L186-1true ~mode3~0 := 1; 5#L161-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 67#L399true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 108#L399-1true check_#res#1 := check_~tmp~1#1; 17#check_returnLabel#1true main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 87#L529true assume !(0 == assert_~arg#1 % 256); 25#L524true havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post33#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1; 45#L499-2true [2024-10-15 01:01:35,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:01:35,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1693212754, now seen corresponding path program 1 times [2024-10-15 01:01:35,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:01:35,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602133346] [2024-10-15 01:01:35,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:01:35,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:01:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:01:35,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-15 01:01:35,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:01:35,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602133346] [2024-10-15 01:01:35,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602133346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:01:35,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:01:35,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 01:01:35,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988119833] [2024-10-15 01:01:35,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:01:35,799 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 01:01:35,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:01:35,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1015368977, now seen corresponding path program 1 times [2024-10-15 01:01:35,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:01:35,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906729217] [2024-10-15 01:01:35,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:01:35,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:01:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:01:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:01:36,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:01:36,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906729217] [2024-10-15 01:01:36,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906729217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:01:36,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:01:36,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 01:01:36,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441021852] [2024-10-15 01:01:36,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:01:36,047 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 01:01:36,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:01:36,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 01:01:36,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 01:01:36,077 INFO L87 Difference]: Start difference. First operand has 113 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 112 states have internal predecessors, (197), 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 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 01:01:36,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:01:36,131 INFO L93 Difference]: Finished difference Result 115 states and 196 transitions. [2024-10-15 01:01:36,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 196 transitions. [2024-10-15 01:01:36,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2024-10-15 01:01:36,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 107 states and 180 transitions. [2024-10-15 01:01:36,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2024-10-15 01:01:36,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2024-10-15 01:01:36,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 180 transitions. [2024-10-15 01:01:36,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 01:01:36,142 INFO L218 hiAutomatonCegarLoop]: Abstraction has 107 states and 180 transitions. [2024-10-15 01:01:36,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 180 transitions. [2024-10-15 01:01:36,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-15 01:01:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.6822429906542056) internal successors, (180), 106 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 01:01:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 180 transitions. [2024-10-15 01:01:36,180 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 180 transitions. [2024-10-15 01:01:36,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 01:01:36,185 INFO L425 stractBuchiCegarLoop]: Abstraction has 107 states and 180 transitions. [2024-10-15 01:01:36,185 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 01:01:36,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 180 transitions. [2024-10-15 01:01:36,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2024-10-15 01:01:36,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:01:36,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:01:36,194 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] [2024-10-15 01:01:36,194 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] [2024-10-15 01:01:36,194 INFO L745 eck$LassoCheckResult]: Stem: 296#$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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 297#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_#t~post33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 303#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 306#L231-1 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 291#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 254#L244-1 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 289#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 299#L257-1 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 286#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 260#L270-1 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 271#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 325#L283-1 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 332#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 301#L296-1 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 330#L306 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 244#L306-1 init_#res#1 := init_~tmp___5~0#1; 340#init_returnLabel#1 main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1; 341#L485 assume !(0 == main_~i2~0#1); 249#L485-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 250#L499-2 [2024-10-15 01:01:36,194 INFO L747 eck$LassoCheckResult]: Loop: 250#L499-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true; 312#L75 assume !(0 != ~mode1~0 % 256); 319#L100 assume !(~r1~0 < 2); 320#L100-1 ~mode1~0 := 1; 283#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 342#L118 assume !(0 != ~mode2~0 % 256); 343#L143 assume !(~r2~0 < 2); 331#L143-1 ~mode2~0 := 1; 322#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 268#L161 assume !(0 != ~mode3~0 % 256); 270#L186 assume !(~r3~0 < 2); 287#L186-1 ~mode3~0 := 1; 247#L161-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 248#L399 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 329#L400 assume ~st1~0 + ~nl1~0 <= 1; 256#L401 assume ~st2~0 + ~nl2~0 <= 1; 257#L402 assume ~st3~0 + ~nl3~0 <= 1; 315#L403 assume ~r1~0 >= 2; 263#$Ultimate##230 assume ~r1~0 < 2; 264#$Ultimate##234 assume ~r1~0 >= 2; 274#$Ultimate##238 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 295#L399-1 check_#res#1 := check_~tmp~1#1; 275#check_returnLabel#1 main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 276#L529 assume !(0 == assert_~arg#1 % 256); 288#L524 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post33#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1; 250#L499-2 [2024-10-15 01:01:36,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:01:36,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1693212754, now seen corresponding path program 2 times [2024-10-15 01:01:36,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:01:36,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500786004] [2024-10-15 01:01:36,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:01:36,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:01:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:01:36,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:01:36,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:01:36,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500786004] [2024-10-15 01:01:36,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500786004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:01:36,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:01:36,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 01:01:36,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310374405] [2024-10-15 01:01:36,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:01:36,283 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 01:01:36,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:01:36,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2056696886, now seen corresponding path program 1 times [2024-10-15 01:01:36,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:01:36,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678569863] [2024-10-15 01:01:36,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:01:36,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:01:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:01:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:01:36,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:01:36,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678569863] [2024-10-15 01:01:36,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678569863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:01:36,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:01:36,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 01:01:36,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638776748] [2024-10-15 01:01:36,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:01:36,304 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 01:01:36,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:01:36,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 01:01:36,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 01:01:36,305 INFO L87 Difference]: Start difference. First operand 107 states and 180 transitions. cyclomatic complexity: 74 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 01:01:36,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:01:36,362 INFO L93 Difference]: Finished difference Result 166 states and 272 transitions. [2024-10-15 01:01:36,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 272 transitions. [2024-10-15 01:01:36,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2024-10-15 01:01:36,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 163 states and 249 transitions. [2024-10-15 01:01:36,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 163 [2024-10-15 01:01:36,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2024-10-15 01:01:36,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 163 states and 249 transitions. [2024-10-15 01:01:36,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 01:01:36,370 INFO L218 hiAutomatonCegarLoop]: Abstraction has 163 states and 249 transitions. [2024-10-15 01:01:36,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states and 249 transitions. [2024-10-15 01:01:36,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 107. [2024-10-15 01:01:36,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.485981308411215) internal successors, (159), 106 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 01:01:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 159 transitions. [2024-10-15 01:01:36,379 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 159 transitions. [2024-10-15 01:01:36,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 01:01:36,380 INFO L425 stractBuchiCegarLoop]: Abstraction has 107 states and 159 transitions. [2024-10-15 01:01:36,380 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 01:01:36,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 159 transitions. [2024-10-15 01:01:36,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2024-10-15 01:01:36,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:01:36,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:01:36,386 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:01:36,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] [2024-10-15 01:01:36,386 INFO L745 eck$LassoCheckResult]: Stem: 578#$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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 579#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_#t~post33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 585#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 588#L231-1 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 573#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 535#L244-1 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 570#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 581#L257-1 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 567#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 541#L270-1 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 552#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 607#L283-1 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 614#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 583#L296-1 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 612#L306 assume ~id1~0 != ~id2~0; 616#L307 assume ~id1~0 != ~id3~0; 547#L308 assume ~id2~0 != ~id3~0; 548#L309 assume ~id1~0 >= 0; 615#L310 assume ~id2~0 >= 0; 592#L311 assume ~id3~0 >= 0; 593#L312 assume 0 == ~r1~0; 565#L313 assume 0 == ~r2~0; 566#L314 assume 0 == ~r3~0; 586#L315 assume ~max1~0 == ~id1~0; 587#L316 assume ~max2~0 == ~id2~0; 526#L317 assume ~max3~0 == ~id3~0; 527#L318 assume 0 == ~st1~0; 630#L319 assume 0 == ~st2~0; 619#L320 assume 0 == ~st3~0; 609#L321 assume 0 == ~nl1~0; 610#L322 assume 0 == ~nl2~0; 524#L323 assume 0 == ~nl3~0; 525#L324 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 553#L325 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 571#L326 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296);init_~tmp___5~0#1 := 1; 572#L306-1 init_#res#1 := init_~tmp___5~0#1; 622#init_returnLabel#1 main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1; 623#L485 assume !(0 == main_~i2~0#1); 530#L485-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 531#L499-2 [2024-10-15 01:01:36,387 INFO L747 eck$LassoCheckResult]: Loop: 531#L499-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true; 594#L75 assume !(0 != ~mode1~0 % 256); 601#L100 assume !(~r1~0 < 2); 602#L100-1 ~mode1~0 := 1; 564#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 624#L118 assume !(0 != ~mode2~0 % 256); 625#L143 assume !(~r2~0 < 2); 613#L143-1 ~mode2~0 := 1; 604#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 549#L161 assume !(0 != ~mode3~0 % 256); 551#L186 assume !(~r3~0 < 2); 568#L186-1 ~mode3~0 := 1; 528#L161-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 529#L399 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 611#L400 assume ~st1~0 + ~nl1~0 <= 1; 537#L401 assume ~st2~0 + ~nl2~0 <= 1; 538#L402 assume ~st3~0 + ~nl3~0 <= 1; 597#L403 assume ~r1~0 >= 2; 542#$Ultimate##230 assume ~r1~0 < 2; 543#$Ultimate##234 assume ~r1~0 >= 2; 555#$Ultimate##238 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 575#L399-1 check_#res#1 := check_~tmp~1#1; 556#check_returnLabel#1 main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 557#L529 assume !(0 == assert_~arg#1 % 256); 569#L524 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post33#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1; 531#L499-2 [2024-10-15 01:01:36,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:01:36,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1849055478, now seen corresponding path program 1 times [2024-10-15 01:01:36,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:01:36,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461291780] [2024-10-15 01:01:36,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:01:36,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:01:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:01:36,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:01:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:01:36,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 01:01:36,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:01:36,535 INFO L85 PathProgramCache]: Analyzing trace with hash 2056696886, now seen corresponding path program 2 times [2024-10-15 01:01:36,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:01:36,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200482432] [2024-10-15 01:01:36,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:01:36,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:01:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:01:36,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:01:36,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:01:36,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200482432] [2024-10-15 01:01:36,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200482432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:01:36,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:01:36,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 01:01:36,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361043340] [2024-10-15 01:01:36,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:01:36,562 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 01:01:36,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:01:36,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 01:01:36,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 01:01:36,564 INFO L87 Difference]: Start difference. First operand 107 states and 159 transitions. cyclomatic complexity: 53 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 01:01:36,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:01:36,607 INFO L93 Difference]: Finished difference Result 151 states and 224 transitions. [2024-10-15 01:01:36,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 224 transitions. [2024-10-15 01:01:36,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2024-10-15 01:01:36,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 151 states and 224 transitions. [2024-10-15 01:01:36,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2024-10-15 01:01:36,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2024-10-15 01:01:36,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 224 transitions. [2024-10-15 01:01:36,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 01:01:36,613 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 224 transitions. [2024-10-15 01:01:36,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 224 transitions. [2024-10-15 01:01:36,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-10-15 01:01:36,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 151 states have (on average 1.4834437086092715) internal successors, (224), 150 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 01:01:36,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 224 transitions. [2024-10-15 01:01:36,623 INFO L240 hiAutomatonCegarLoop]: Abstraction has 151 states and 224 transitions. [2024-10-15 01:01:36,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 01:01:36,628 INFO L425 stractBuchiCegarLoop]: Abstraction has 151 states and 224 transitions. [2024-10-15 01:01:36,628 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 01:01:36,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 224 transitions. [2024-10-15 01:01:36,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2024-10-15 01:01:36,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:01:36,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:01:36,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 01:01:36,630 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-15 01:01:36,630 INFO L745 eck$LassoCheckResult]: Stem: 842#$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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 843#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_#t~post33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 850#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 853#L231-1 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 837#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 799#L244-1 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 834#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 845#L257-1 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 830#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 805#L270-1 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 815#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 873#L283-1 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 880#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 847#L296-1 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 878#L306 assume ~id1~0 != ~id2~0; 882#L307 assume ~id1~0 != ~id3~0; 810#L308 assume ~id2~0 != ~id3~0; 811#L309 assume ~id1~0 >= 0; 881#L310 assume ~id2~0 >= 0; 858#L311 assume ~id3~0 >= 0; 859#L312 assume 0 == ~r1~0; 828#L313 assume 0 == ~r2~0; 829#L314 assume 0 == ~r3~0; 851#L315 assume ~max1~0 == ~id1~0; 852#L316 assume ~max2~0 == ~id2~0; 790#L317 assume ~max3~0 == ~id3~0; 791#L318 assume 0 == ~st1~0; 899#L319 assume 0 == ~st2~0; 885#L320 assume 0 == ~st3~0; 875#L321 assume 0 == ~nl1~0; 876#L322 assume 0 == ~nl2~0; 788#L323 assume 0 == ~nl3~0; 789#L324 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 816#L325 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 835#L326 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296);init_~tmp___5~0#1 := 1; 836#L306-1 init_#res#1 := init_~tmp___5~0#1; 889#init_returnLabel#1 main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1; 890#L485 assume !(0 == main_~i2~0#1); 794#L485-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 795#L499-2 [2024-10-15 01:01:36,632 INFO L747 eck$LassoCheckResult]: Loop: 795#L499-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true; 903#L75 assume !(0 != ~mode1~0 % 256); 901#L100 assume ~r1~0 < 2; 898#L101 assume !(0 != ~ep12~0 % 256); 887#L101-2 assume 0 != ~ep13~0 % 256;~p13_new~0 := (if (if ~max1~0 != ~nomsg~0 && ~p13_new~0 == ~nomsg~0 then ~max1~0 else ~p13_new~0) % 256 <= 127 then (if ~max1~0 != ~nomsg~0 && ~p13_new~0 == ~nomsg~0 then ~max1~0 else ~p13_new~0) % 256 else (if ~max1~0 != ~nomsg~0 && ~p13_new~0 == ~nomsg~0 then ~max1~0 else ~p13_new~0) % 256 - 256); 888#L100-1 ~mode1~0 := 1; 931#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 927#L118 assume !(0 != ~mode2~0 % 256); 923#L143 assume !(~r2~0 < 2); 921#L143-1 ~mode2~0 := 1; 919#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 917#L161 assume !(0 != ~mode3~0 % 256); 915#L186 assume !(~r3~0 < 2); 912#L186-1 ~mode3~0 := 1; 909#L161-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 907#L399 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 905#L400 assume ~st1~0 + ~nl1~0 <= 1; 904#L401 assume ~st2~0 + ~nl2~0 <= 1; 902#L402 assume ~st3~0 + ~nl3~0 <= 1; 900#L403 assume !(~r1~0 >= 2); 848#L406 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 849#$Ultimate##230 assume ~r1~0 < 2; 938#$Ultimate##234 assume !(~r1~0 >= 2); 817#L416 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 818#$Ultimate##238 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 913#L399-1 check_#res#1 := check_~tmp~1#1; 910#check_returnLabel#1 main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 908#L529 assume !(0 == assert_~arg#1 % 256); 906#L524 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post33#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1; 795#L499-2 [2024-10-15 01:01:36,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:01:36,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1849055478, now seen corresponding path program 2 times [2024-10-15 01:01:36,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:01:36,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926234490] [2024-10-15 01:01:36,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:01:36,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:01:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:01:36,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:01:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:01:36,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 01:01:36,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:01:36,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1740395060, now seen corresponding path program 1 times [2024-10-15 01:01:36,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:01:36,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59434701] [2024-10-15 01:01:36,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:01:36,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:01:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:01:36,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:01:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:01:36,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 01:01:36,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:01:36,827 INFO L85 PathProgramCache]: Analyzing trace with hash 504141047, now seen corresponding path program 1 times [2024-10-15 01:01:36,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:01:36,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456039539] [2024-10-15 01:01:36,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:01:36,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:01:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:01:36,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:01:36,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:01:36,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456039539] [2024-10-15 01:01:36,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456039539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:01:36,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:01:36,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 01:01:36,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131048984] [2024-10-15 01:01:36,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:01:37,937 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 01:01:37,938 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 01:01:37,938 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 01:01:37,938 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 01:01:37,938 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 01:01:37,938 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:37,938 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 01:01:37,938 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 01:01:37,938 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2024-10-15 01:01:37,938 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 01:01:37,939 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 01:01:37,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:37,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:37,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:37,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:37,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:37,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:37,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:37,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:37,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:37,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:38,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:38,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:38,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:38,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:38,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:38,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:38,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:38,634 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2024-10-15 01:01:39,726 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 01:01:39,729 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 01:01:39,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:39,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:01:39,733 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 01:01:39,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-15 01:01:39,735 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 01:01:39,735 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:01:39,760 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 01:01:39,760 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=0} Honda state: {~ep12~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 01:01:39,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-15 01:01:39,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:39,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:01:39,774 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 01:01:39,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-15 01:01:39,777 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 01:01:39,778 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:01:39,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-15 01:01:39,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:39,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:01:39,816 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 01:01:39,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-15 01:01:39,820 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 01:01:39,820 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:01:39,905 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 01:01:39,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-15 01:01:39,914 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 01:01:39,915 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 01:01:39,915 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 01:01:39,915 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 01:01:39,915 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 01:01:39,915 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:39,915 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 01:01:39,915 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 01:01:39,915 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2024-10-15 01:01:39,915 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 01:01:39,915 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 01:01:39,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:39,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:39,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:39,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:39,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:39,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:39,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:39,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:39,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:39,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:39,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:39,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:40,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:40,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:40,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:40,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:40,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:01:40,588 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2024-10-15 01:01:41,622 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 01:01:41,629 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 01:01:41,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:41,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:01:41,636 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 01:01:41,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-15 01:01:41,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:01:41,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:01:41,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:01:41,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:01:41,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:01:41,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:01:41,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:01:41,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:01:41,669 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:01:41,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-15 01:01:41,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:41,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:01:41,693 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 01:01:41,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-15 01:01:41,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:01:41,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:01:41,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:01:41,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:01:41,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:01:41,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:01:41,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:01:41,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:01:41,716 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:01:41,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-15 01:01:41,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:41,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:01:41,729 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 01:01:41,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-15 01:01:41,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:01:41,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:01:41,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:01:41,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:01:41,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:01:41,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:01:41,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:01:41,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:01:41,747 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:01:41,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-15 01:01:41,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:41,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:01:41,763 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 01:01:41,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-15 01:01:41,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:01:41,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:01:41,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:01:41,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:01:41,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:01:41,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:01:41,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:01:41,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:01:41,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:01:41,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-15 01:01:41,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:41,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:01:41,800 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 01:01:41,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-15 01:01:41,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:01:41,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:01:41,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:01:41,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:01:41,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:01:41,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:01:41,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:01:41,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:01:41,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:01:41,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-15 01:01:41,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:41,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:01:41,843 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 01:01:41,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-15 01:01:41,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:01:41,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:01:41,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:01:41,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:01:41,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:01:41,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:01:41,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:01:41,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:01:41,857 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:01:41,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-15 01:01:41,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:41,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:01:41,870 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 01:01:41,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-15 01:01:41,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:01:41,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:01:41,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:01:41,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:01:41,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:01:41,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:01:41,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:01:41,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:01:41,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:01:41,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-15 01:01:41,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:41,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:01:41,924 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 01:01:41,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-15 01:01:41,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:01:41,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:01:41,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:01:41,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:01:41,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:01:41,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:01:41,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:01:41,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:01:41,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:01:41,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-15 01:01:41,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:41,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:01:41,968 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 01:01:41,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-15 01:01:41,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:01:41,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:01:41,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:01:41,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:01:41,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:01:41,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:01:41,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:01:41,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:01:41,985 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:01:41,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-15 01:01:41,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:41,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:01:42,001 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 01:01:42,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-15 01:01:42,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:01:42,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:01:42,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:01:42,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:01:42,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:01:42,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:01:42,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:01:42,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:01:42,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:01:42,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-15 01:01:42,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:42,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:01:42,030 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 01:01:42,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-15 01:01:42,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:01:42,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:01:42,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:01:42,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:01:42,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:01:42,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:01:42,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:01:42,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:01:42,046 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:01:42,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-15 01:01:42,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:42,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:01:42,058 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 01:01:42,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-15 01:01:42,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:01:42,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:01:42,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:01:42,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:01:42,071 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2024-10-15 01:01:42,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:01:42,120 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2024-10-15 01:01:42,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:01:42,158 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:01:42,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-15 01:01:42,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:42,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:01:42,172 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 01:01:42,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-15 01:01:42,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:01:42,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:01:42,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:01:42,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:01:42,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:01:42,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:01:42,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:01:42,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:01:42,189 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:01:42,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-15 01:01:42,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:42,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:01:42,202 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 01:01:42,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-15 01:01:42,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 01:01:42,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:01:42,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:01:42,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:01:42,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:01:42,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:01:42,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:01:42,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:01:42,218 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 01:01:42,223 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 01:01:42,223 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 01:01:42,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:01:42,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:01:42,230 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 01:01:42,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-15 01:01:42,232 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 01:01:42,232 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 01:01:42,232 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 01:01:42,233 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 11 Supporting invariants [] [2024-10-15 01:01:42,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-15 01:01:42,252 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 01:01:42,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:01:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:01:42,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 01:01:42,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 01:01:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:01:42,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 01:01:42,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 01:01:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 01:01:42,549 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 01:01:42,550 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 151 states and 224 transitions. cyclomatic complexity: 74 Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 01:01:42,592 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 151 states and 224 transitions. cyclomatic complexity: 74. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 250 states and 379 transitions. Complement of second has 4 states. [2024-10-15 01:01:42,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 01:01:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 01:01:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2024-10-15 01:01:42,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 39 letters. Loop has 29 letters. [2024-10-15 01:01:42,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 01:01:42,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 68 letters. Loop has 29 letters. [2024-10-15 01:01:42,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 01:01:42,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 39 letters. Loop has 58 letters. [2024-10-15 01:01:42,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 01:01:42,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 250 states and 379 transitions. [2024-10-15 01:01:42,599 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 01:01:42,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 250 states to 0 states and 0 transitions. [2024-10-15 01:01:42,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 01:01:42,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 01:01:42,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 01:01:42,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 01:01:42,600 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 01:01:42,600 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 01:01:42,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:01:42,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 01:01:42,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 01:01:42,601 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 01:01:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:01:42,601 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2024-10-15 01:01:42,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2024-10-15 01:01:42,601 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 01:01:42,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 01:01:42,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 01:01:42,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 01:01:42,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 01:01:42,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 01:01:42,602 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 01:01:42,602 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 01:01:42,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 01:01:42,602 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 01:01:42,602 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 01:01:42,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-15 01:01:42,603 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 01:01:42,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-15 01:01:42,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 01:01:42 BoogieIcfgContainer [2024-10-15 01:01:42,609 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 01:01:42,610 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 01:01:42,610 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 01:01:42,610 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 01:01:42,610 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:01:35" (3/4) ... [2024-10-15 01:01:42,612 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-15 01:01:42,613 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 01:01:42,613 INFO L158 Benchmark]: Toolchain (without parser) took 8302.02ms. Allocated memory was 190.8MB in the beginning and 281.0MB in the end (delta: 90.2MB). Free memory was 160.1MB in the beginning and 149.9MB in the end (delta: 10.2MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. [2024-10-15 01:01:42,613 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 136.3MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 01:01:42,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.22ms. Allocated memory is still 190.8MB. Free memory was 160.1MB in the beginning and 142.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-15 01:01:42,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.36ms. Allocated memory is still 190.8MB. Free memory was 142.4MB in the beginning and 139.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-15 01:01:42,614 INFO L158 Benchmark]: Boogie Preprocessor took 47.82ms. Allocated memory is still 190.8MB. Free memory was 139.3MB in the beginning and 136.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 01:01:42,614 INFO L158 Benchmark]: RCFGBuilder took 569.82ms. Allocated memory is still 190.8MB. Free memory was 136.1MB in the beginning and 102.4MB in the end (delta: 33.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-15 01:01:42,615 INFO L158 Benchmark]: BuchiAutomizer took 7303.28ms. Allocated memory was 190.8MB in the beginning and 281.0MB in the end (delta: 90.2MB). Free memory was 102.4MB in the beginning and 151.0MB in the end (delta: -48.5MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2024-10-15 01:01:42,615 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 281.0MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 01:01:42,616 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 136.3MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.22ms. Allocated memory is still 190.8MB. Free memory was 160.1MB in the beginning and 142.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.36ms. Allocated memory is still 190.8MB. Free memory was 142.4MB in the beginning and 139.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.82ms. Allocated memory is still 190.8MB. Free memory was 139.3MB in the beginning and 136.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 569.82ms. Allocated memory is still 190.8MB. Free memory was 136.1MB in the beginning and 102.4MB in the end (delta: 33.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 7303.28ms. Allocated memory was 190.8MB in the beginning and 281.0MB in the end (delta: 90.2MB). Free memory was 102.4MB in the beginning and 151.0MB in the end (delta: -48.5MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 281.0MB. Free memory is still 149.9MB. There was no memory consumed. 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i2) + 11) and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 6.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 56 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 298 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 1965 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1284 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 681 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital241 mio100 ax100 hnf100 lsp288 ukn21 mio100 lsp100 div131 bol100 ite100 ukn100 eq174 hnf95 smp79 dnf1417 smp19 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 101ms VariablesStem: 0 VariablesLoop: 24 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-15 01:01:42,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-15 01:01:42,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE