./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.4.ufo.BOUNDED-8.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 80f9a5324ebd6f7f9b0f4370bb23b9787fd1aa3c807ea310f755bbaf1b53f47a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 15:11:34,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 15:11:34,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 15:11:34,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 15:11:34,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 15:11:34,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 15:11:34,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 15:11:34,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 15:11:34,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 15:11:34,826 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 15:11:34,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 15:11:34,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 15:11:34,827 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 15:11:34,828 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 15:11:34,828 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 15:11:34,828 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 15:11:34,828 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 15:11:34,828 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 15:11:34,829 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 15:11:34,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 15:11:34,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 15:11:34,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 15:11:34,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 15:11:34,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 15:11:34,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 15:11:34,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 15:11:34,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 15:11:34,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 15:11:34,832 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 15:11:34,832 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 15:11:34,832 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 15:11:34,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 15:11:34,832 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 15:11:34,833 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 15:11:34,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 15:11:34,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 15:11:34,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 15:11:34,834 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 15:11:34,835 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 15:11:34,835 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 -> 80f9a5324ebd6f7f9b0f4370bb23b9787fd1aa3c807ea310f755bbaf1b53f47a [2024-11-19 15:11:35,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 15:11:35,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 15:11:35,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 15:11:35,173 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 15:11:35,174 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 15:11:35,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c [2024-11-19 15:11:36,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 15:11:36,831 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 15:11:36,832 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c [2024-11-19 15:11:36,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9563cd526/2bd686868e1e4456a9cadf46f586936f/FLAGf87edeaa5 [2024-11-19 15:11:36,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9563cd526/2bd686868e1e4456a9cadf46f586936f [2024-11-19 15:11:36,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 15:11:36,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 15:11:36,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 15:11:36,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 15:11:36,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 15:11:36,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:11:36" (1/1) ... [2024-11-19 15:11:36,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@281128d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:11:36, skipping insertion in model container [2024-11-19 15:11:36,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:11:36" (1/1) ... [2024-11-19 15:11:36,927 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 15:11:37,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 15:11:37,287 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 15:11:37,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 15:11:37,394 INFO L204 MainTranslator]: Completed translation [2024-11-19 15:11:37,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:11:37 WrapperNode [2024-11-19 15:11:37,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 15:11:37,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 15:11:37,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 15:11:37,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 15:11:37,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:11:37" (1/1) ... [2024-11-19 15:11:37,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:11:37" (1/1) ... [2024-11-19 15:11:37,464 INFO L138 Inliner]: procedures = 23, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 997 [2024-11-19 15:11:37,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 15:11:37,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 15:11:37,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 15:11:37,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 15:11:37,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:11:37" (1/1) ... [2024-11-19 15:11:37,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:11:37" (1/1) ... [2024-11-19 15:11:37,490 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:11:37" (1/1) ... [2024-11-19 15:11:37,527 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 15:11:37,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:11:37" (1/1) ... [2024-11-19 15:11:37,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:11:37" (1/1) ... [2024-11-19 15:11:37,559 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:11:37" (1/1) ... [2024-11-19 15:11:37,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:11:37" (1/1) ... [2024-11-19 15:11:37,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:11:37" (1/1) ... [2024-11-19 15:11:37,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:11:37" (1/1) ... [2024-11-19 15:11:37,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 15:11:37,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 15:11:37,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 15:11:37,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 15:11:37,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:11:37" (1/1) ... [2024-11-19 15:11:37,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:11:37,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:11:37,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:11:37,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 15:11:37,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 15:11:37,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 15:11:37,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 15:11:37,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 15:11:37,851 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 15:11:37,853 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 15:11:38,838 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2024-11-19 15:11:38,839 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 15:11:38,865 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 15:11:38,866 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 15:11:38,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:11:38 BoogieIcfgContainer [2024-11-19 15:11:38,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 15:11:38,868 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 15:11:38,868 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 15:11:38,872 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 15:11:38,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 15:11:38,874 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 03:11:36" (1/3) ... [2024-11-19 15:11:38,875 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62145721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 03:11:38, skipping insertion in model container [2024-11-19 15:11:38,875 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 15:11:38,876 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:11:37" (2/3) ... [2024-11-19 15:11:38,876 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62145721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 03:11:38, skipping insertion in model container [2024-11-19 15:11:38,876 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 15:11:38,877 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:11:38" (3/3) ... [2024-11-19 15:11:38,878 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c [2024-11-19 15:11:38,935 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 15:11:38,935 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 15:11:38,936 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 15:11:38,936 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 15:11:38,936 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 15:11:38,936 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 15:11:38,937 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 15:11:38,937 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 15:11:38,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 300 states, 299 states have (on average 1.826086956521739) internal successors, (546), 299 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:11:38,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2024-11-19 15:11:38,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:11:38,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:11:38,984 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:11:38,985 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] [2024-11-19 15:11:38,985 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 15:11:38,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 300 states, 299 states have (on average 1.826086956521739) internal successors, (546), 299 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:11:39,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2024-11-19 15:11:39,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:11:39,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:11:39,006 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:11:39,006 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] [2024-11-19 15:11:39,015 INFO L745 eck$LassoCheckResult]: Stem: 186#$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(43, 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;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~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;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~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;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; 199#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~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1, main_#t~post50#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;~ep14~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;~ep21~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;~ep23~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;~ep24~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;assume 0 == main_#t~nondet10#1 || 1 == main_#t~nondet10#1;~ep31~0 := (if 0 == main_#t~nondet10#1 % 256 then 0 else 1);havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;assume 0 == main_#t~nondet11#1 || 1 == main_#t~nondet11#1;~ep32~0 := (if 0 == main_#t~nondet11#1 % 256 then 0 else 1);havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume 0 == main_#t~nondet12#1 || 1 == main_#t~nondet12#1;~ep34~0 := (if 0 == main_#t~nondet12#1 % 256 then 0 else 1);havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;assume 0 == main_#t~nondet13#1 || 1 == main_#t~nondet13#1;~ep41~0 := (if 0 == main_#t~nondet13#1 % 256 then 0 else 1);havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;assume 0 == main_#t~nondet14#1 || 1 == main_#t~nondet14#1;~ep42~0 := (if 0 == main_#t~nondet14#1 % 256 then 0 else 1);havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume 0 == main_#t~nondet15#1 || 1 == main_#t~nondet15#1;~ep43~0 := (if 0 == main_#t~nondet15#1 % 256 then 0 else 1);havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;assume 0 == main_#t~nondet22#1 || 1 == main_#t~nondet22#1;~mode1~0 := (if 0 == main_#t~nondet22#1 % 256 then 0 else 1);havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~newmax1~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max2~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;~mode2~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~newmax2~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~mode3~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~newmax3~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~id4~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~r4~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~st4~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~nl4~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~m4~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~max4~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~mode4~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~newmax4~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~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_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~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_~r141~0#1 := (if 0 == ~ep14~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_~r241~0#1 := (if 0 == ~ep24~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);init_~r341~0#1 := (if 0 == ~ep34~0 % 256 then 0 else 1);init_~r411~0#1 := (if 0 == ~ep41~0 % 256 then 0 else 1);init_~r421~0#1 := (if 0 == ~ep42~0 % 256 then 0 else 1);init_~r431~0#1 := (if 0 == ~ep43~0 % 256 then 0 else 1); 28#L441true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 237#L452true init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 97#L462true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 135#L473true init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 265#L483true assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 241#L494true init_~r142~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 242#L504true assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 52#L515true init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 2#L525true assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 232#L536true init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 46#L546true assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 297#L557true init_~r242~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 63#L567true assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 208#L578true init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___5~0#1 then 0 else 1) % 256 then 0 else 1); 107#L588true assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 225#L599true init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___6~0#1 then 0 else 1) % 256 then 0 else 1); 94#L609true assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 71#L620true init_~r342~0#1 := (if 0 == (if 0 == init_~tmp___7~0#1 then 0 else 1) % 256 then 0 else 1); 100#L630true assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 202#L641true init_~r412~0#1 := (if 0 == (if 0 == init_~tmp___8~0#1 then 0 else 1) % 256 then 0 else 1); 281#L651true assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 210#L662true init_~r422~0#1 := (if 0 == (if 0 == init_~tmp___9~0#1 then 0 else 1) % 256 then 0 else 1); 129#L672true assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 243#L683true init_~r432~0#1 := (if 0 == (if 0 == init_~tmp___10~0#1 then 0 else 1) % 256 then 0 else 1); 284#L693true assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 221#L704true init_~r123~0#1 := (if 0 == (if 0 == init_~tmp___11~0#1 then 0 else 1) % 256 then 0 else 1); 162#L714true assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 13#L725true init_~r133~0#1 := (if 0 == (if 0 == init_~tmp___12~0#1 then 0 else 1) % 256 then 0 else 1); 290#L735true assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 105#L746true init_~r143~0#1 := (if 0 == (if 0 == init_~tmp___13~0#1 then 0 else 1) % 256 then 0 else 1); 92#L756true assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 271#L767true init_~r213~0#1 := (if 0 == (if 0 == init_~tmp___14~0#1 then 0 else 1) % 256 then 0 else 1); 29#L777true assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 145#L788true init_~r233~0#1 := (if 0 == (if 0 == init_~tmp___15~0#1 then 0 else 1) % 256 then 0 else 1); 207#L798true assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 286#L809true init_~r243~0#1 := (if 0 == (if 0 == init_~tmp___16~0#1 then 0 else 1) % 256 then 0 else 1); 211#L819true assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 266#L830true init_~r313~0#1 := (if 0 == (if 0 == init_~tmp___17~0#1 then 0 else 1) % 256 then 0 else 1); 125#L840true assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 244#L851true init_~r323~0#1 := (if 0 == (if 0 == init_~tmp___18~0#1 then 0 else 1) % 256 then 0 else 1); 189#L861true assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 246#L872true init_~r343~0#1 := (if 0 == (if 0 == init_~tmp___19~0#1 then 0 else 1) % 256 then 0 else 1); 198#L882true assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 95#L893true init_~r413~0#1 := (if 0 == (if 0 == init_~tmp___20~0#1 then 0 else 1) % 256 then 0 else 1); 262#L903true assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 93#L914true init_~r423~0#1 := (if 0 == (if 0 == init_~tmp___21~0#1 then 0 else 1) % 256 then 0 else 1); 250#L924true assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 86#L935true init_~r433~0#1 := (if 0 == (if 0 == init_~tmp___22~0#1 then 0 else 1) % 256 then 0 else 1); 121#L945true assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 213#L945-1true init_#res#1 := init_~tmp___23~0#1; 111#init_returnLabel#1true main_#t~ret48#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 116#L21true assume !(0 == assume_abort_if_not_~cond#1); 173#L20true havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 143#L1271-2true [2024-11-19 15:11:39,016 INFO L747 eck$LassoCheckResult]: Loop: 143#L1271-2true assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 68#L114true assume !(0 != ~mode1~0 % 256); 258#L150true assume !(~r1~0 < 2); 163#L150-1true ~mode1~0 := 1; 53#L114-2true havoc node1_~newmax~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 33#L178true assume !(0 != ~mode2~0 % 256); 289#L214true assume !(~r2~0 < 3); 98#L214-1true ~mode2~0 := 1; 165#L178-2true havoc node2_~newmax~1#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 298#L242true assume !(0 != ~mode3~0 % 256); 151#L278true assume !(~r3~0 < 3); 120#L278-1true ~mode3~0 := 1; 218#L242-2true havoc node3_~newmax~2#1;assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; 138#L306true assume !(0 != ~mode4~0 % 256); 45#L342true assume !(~r4~0 < 3); 16#L342-1true ~mode4~0 := 1; 57#L306-2true havoc node4_~newmax~3#1;assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_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;~p24_old~0 := ~p24_new~0;~p24_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;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 153#L1138true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 179#L1138-1true check_#res#1 := check_~tmp~1#1; 175#check_returnLabel#1true main_#t~ret49#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret49#1;havoc main_#t~ret49#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; 181#L1314true assume !(0 == assert_~arg#1 % 256); 270#L1309true havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post50#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post50#1;havoc main_#t~post50#1; 143#L1271-2true [2024-11-19 15:11:39,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:11:39,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2064134942, now seen corresponding path program 1 times [2024-11-19 15:11:39,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:11:39,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974603334] [2024-11-19 15:11:39,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:11:39,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:11:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:11:39,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:11:39,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:11:39,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974603334] [2024-11-19 15:11:39,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974603334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:11:39,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:11:39,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 15:11:39,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948652003] [2024-11-19 15:11:39,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:11:39,729 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:11:39,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:11:39,730 INFO L85 PathProgramCache]: Analyzing trace with hash 893833525, now seen corresponding path program 1 times [2024-11-19 15:11:39,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:11:39,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043731717] [2024-11-19 15:11:39,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:11:39,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:11:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:11:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:11:39,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:11:39,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043731717] [2024-11-19 15:11:39,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043731717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:11:39,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:11:39,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 15:11:39,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287469324] [2024-11-19 15:11:39,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:11:39,934 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:11:39,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:11:39,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 15:11:39,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 15:11:39,975 INFO L87 Difference]: Start difference. First operand has 300 states, 299 states have (on average 1.826086956521739) internal successors, (546), 299 states have internal predecessors, (546), 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 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:11:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:11:40,077 INFO L93 Difference]: Finished difference Result 302 states and 545 transitions. [2024-11-19 15:11:40,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 302 states and 545 transitions. [2024-11-19 15:11:40,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 98 [2024-11-19 15:11:40,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 302 states to 294 states and 528 transitions. [2024-11-19 15:11:40,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2024-11-19 15:11:40,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2024-11-19 15:11:40,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 294 states and 528 transitions. [2024-11-19 15:11:40,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:11:40,105 INFO L218 hiAutomatonCegarLoop]: Abstraction has 294 states and 528 transitions. [2024-11-19 15:11:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states and 528 transitions. [2024-11-19 15:11:40,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-11-19 15:11:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 294 states have (on average 1.7959183673469388) internal successors, (528), 293 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:11:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 528 transitions. [2024-11-19 15:11:40,151 INFO L240 hiAutomatonCegarLoop]: Abstraction has 294 states and 528 transitions. [2024-11-19 15:11:40,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 15:11:40,156 INFO L425 stractBuchiCegarLoop]: Abstraction has 294 states and 528 transitions. [2024-11-19 15:11:40,156 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 15:11:40,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 294 states and 528 transitions. [2024-11-19 15:11:40,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 98 [2024-11-19 15:11:40,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:11:40,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:11:40,161 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:11:40,161 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, 1] [2024-11-19 15:11:40,162 INFO L745 eck$LassoCheckResult]: Stem: 881#$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(43, 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;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~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;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~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;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; 882#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~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1, main_#t~post50#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;~ep14~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;~ep21~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;~ep23~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;~ep24~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;assume 0 == main_#t~nondet10#1 || 1 == main_#t~nondet10#1;~ep31~0 := (if 0 == main_#t~nondet10#1 % 256 then 0 else 1);havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;assume 0 == main_#t~nondet11#1 || 1 == main_#t~nondet11#1;~ep32~0 := (if 0 == main_#t~nondet11#1 % 256 then 0 else 1);havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume 0 == main_#t~nondet12#1 || 1 == main_#t~nondet12#1;~ep34~0 := (if 0 == main_#t~nondet12#1 % 256 then 0 else 1);havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;assume 0 == main_#t~nondet13#1 || 1 == main_#t~nondet13#1;~ep41~0 := (if 0 == main_#t~nondet13#1 % 256 then 0 else 1);havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;assume 0 == main_#t~nondet14#1 || 1 == main_#t~nondet14#1;~ep42~0 := (if 0 == main_#t~nondet14#1 % 256 then 0 else 1);havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume 0 == main_#t~nondet15#1 || 1 == main_#t~nondet15#1;~ep43~0 := (if 0 == main_#t~nondet15#1 % 256 then 0 else 1);havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;assume 0 == main_#t~nondet22#1 || 1 == main_#t~nondet22#1;~mode1~0 := (if 0 == main_#t~nondet22#1 % 256 then 0 else 1);havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~newmax1~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max2~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;~mode2~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~newmax2~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~mode3~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~newmax3~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~id4~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~r4~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~st4~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~nl4~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~m4~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~max4~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~mode4~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~newmax4~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~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_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~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_~r141~0#1 := (if 0 == ~ep14~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_~r241~0#1 := (if 0 == ~ep24~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);init_~r341~0#1 := (if 0 == ~ep34~0 % 256 then 0 else 1);init_~r411~0#1 := (if 0 == ~ep41~0 % 256 then 0 else 1);init_~r421~0#1 := (if 0 == ~ep42~0 % 256 then 0 else 1);init_~r431~0#1 := (if 0 == ~ep43~0 % 256 then 0 else 1); 680#L441 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 681#L452 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 799#L462 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 765#L473 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 836#L483 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 739#L494 init_~r142~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 902#L504 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 698#L515 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 616#L525 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 617#L536 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 715#L546 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 716#L557 init_~r242~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 745#L567 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 659#L578 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___5~0#1 then 0 else 1) % 256 then 0 else 1); 811#L588 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 667#L599 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___6~0#1 then 0 else 1) % 256 then 0 else 1); 796#L609 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 723#L620 init_~r342~0#1 := (if 0 == (if 0 == init_~tmp___7~0#1 then 0 else 1) % 256 then 0 else 1); 763#L630 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 733#L641 init_~r412~0#1 := (if 0 == (if 0 == init_~tmp___8~0#1 then 0 else 1) % 256 then 0 else 1); 889#L651 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 669#L662 init_~r422~0#1 := (if 0 == (if 0 == init_~tmp___9~0#1 then 0 else 1) % 256 then 0 else 1); 831#L672 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 832#L683 init_~r432~0#1 := (if 0 == (if 0 == init_~tmp___10~0#1 then 0 else 1) % 256 then 0 else 1); 903#L693 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 752#L704 init_~r123~0#1 := (if 0 == (if 0 == init_~tmp___11~0#1 then 0 else 1) % 256 then 0 else 1); 863#L714 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 648#L725 init_~r133~0#1 := (if 0 == (if 0 == init_~tmp___12~0#1 then 0 else 1) % 256 then 0 else 1); 649#L735 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 620#L746 init_~r143~0#1 := (if 0 == (if 0 == init_~tmp___13~0#1 then 0 else 1) % 256 then 0 else 1); 793#L756 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 641#L767 init_~r213~0#1 := (if 0 == (if 0 == init_~tmp___14~0#1 then 0 else 1) % 256 then 0 else 1); 683#L777 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 684#L788 init_~r233~0#1 := (if 0 == (if 0 == init_~tmp___15~0#1 then 0 else 1) % 256 then 0 else 1); 846#L798 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 859#L809 init_~r243~0#1 := (if 0 == (if 0 == init_~tmp___16~0#1 then 0 else 1) % 256 then 0 else 1); 893#L819 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 644#L830 init_~r313~0#1 := (if 0 == (if 0 == init_~tmp___17~0#1 then 0 else 1) % 256 then 0 else 1); 827#L840 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 627#L851 init_~r323~0#1 := (if 0 == (if 0 == init_~tmp___18~0#1 then 0 else 1) % 256 then 0 else 1); 884#L861 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 728#L872 init_~r343~0#1 := (if 0 == (if 0 == init_~tmp___19~0#1 then 0 else 1) % 256 then 0 else 1); 887#L882 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 704#L893 init_~r413~0#1 := (if 0 == (if 0 == init_~tmp___20~0#1 then 0 else 1) % 256 then 0 else 1); 797#L903 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 769#L914 init_~r423~0#1 := (if 0 == (if 0 == init_~tmp___21~0#1 then 0 else 1) % 256 then 0 else 1); 795#L924 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 785#L935 init_~r433~0#1 := (if 0 == (if 0 == init_~tmp___22~0#1 then 0 else 1) % 256 then 0 else 1); 786#L945 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 633#L945-1 init_#res#1 := init_~tmp___23~0#1; 814#init_returnLabel#1 main_#t~ret48#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 815#L21 assume !(0 == assume_abort_if_not_~cond#1); 821#L20 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 845#L1271-2 [2024-11-19 15:11:40,163 INFO L747 eck$LassoCheckResult]: Loop: 845#L1271-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 754#L114 assume !(0 != ~mode1~0 % 256); 755#L150 assume !(~r1~0 < 2); 838#L150-1 ~mode1~0 := 1; 726#L114-2 havoc node1_~newmax~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 691#L178 assume !(0 != ~mode2~0 % 256); 692#L214 assume !(~r2~0 < 3); 657#L214-1 ~mode2~0 := 1; 801#L178-2 havoc node2_~newmax~1#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 865#L242 assume !(0 != ~mode3~0 % 256); 852#L278 assume !(~r3~0 < 3); 774#L278-1 ~mode3~0 := 1; 820#L242-2 havoc node3_~newmax~2#1;assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; 840#L306 assume !(0 != ~mode4~0 % 256); 712#L342 assume !(~r4~0 < 3); 652#L342-1 ~mode4~0 := 1; 653#L306-2 havoc node4_~newmax~3#1;assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_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;~p24_old~0 := ~p24_new~0;~p24_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;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 734#L1138 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 853#L1139 assume ~st1~0 + ~nl1~0 <= 1; 888#L1140 assume ~st2~0 + ~nl2~0 <= 1; 855#L1141 assume ~st3~0 + ~nl3~0 <= 1; 856#L1142 assume ~st4~0 + ~nl4~0 <= 1; 802#L1143 assume ~r1~0 >= 3; 804#$Ultimate##714 assume ~r1~0 < 3; 711#$Ultimate##718 assume ~r1~0 >= 3; 808#$Ultimate##722 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 809#L1138-1 check_#res#1 := check_~tmp~1#1; 870#check_returnLabel#1 main_#t~ret49#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret49#1;havoc main_#t~ret49#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; 871#L1314 assume !(0 == assert_~arg#1 % 256); 875#L1309 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post50#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post50#1;havoc main_#t~post50#1; 845#L1271-2 [2024-11-19 15:11:40,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:11:40,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2064134942, now seen corresponding path program 2 times [2024-11-19 15:11:40,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:11:40,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542949797] [2024-11-19 15:11:40,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:11:40,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:11:40,216 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 15:11:40,217 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:11:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:11:40,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:11:40,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542949797] [2024-11-19 15:11:40,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542949797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:11:40,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:11:40,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 15:11:40,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174775339] [2024-11-19 15:11:40,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:11:40,421 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:11:40,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:11:40,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1402594052, now seen corresponding path program 1 times [2024-11-19 15:11:40,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:11:40,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009482805] [2024-11-19 15:11:40,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:11:40,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:11:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:11:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:11:40,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:11:40,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009482805] [2024-11-19 15:11:40,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009482805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:11:40,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:11:40,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:11:40,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760128235] [2024-11-19 15:11:40,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:11:40,483 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:11:40,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:11:40,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:11:40,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:11:40,484 INFO L87 Difference]: Start difference. First operand 294 states and 528 transitions. cyclomatic complexity: 235 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:11:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:11:40,560 INFO L93 Difference]: Finished difference Result 373 states and 656 transitions. [2024-11-19 15:11:40,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 373 states and 656 transitions. [2024-11-19 15:11:40,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 177 [2024-11-19 15:11:40,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 373 states to 373 states and 656 transitions. [2024-11-19 15:11:40,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 373 [2024-11-19 15:11:40,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 373 [2024-11-19 15:11:40,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 373 states and 656 transitions. [2024-11-19 15:11:40,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:11:40,572 INFO L218 hiAutomatonCegarLoop]: Abstraction has 373 states and 656 transitions. [2024-11-19 15:11:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 656 transitions. [2024-11-19 15:11:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2024-11-19 15:11:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 373 states have (on average 1.7587131367292226) internal successors, (656), 372 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:11:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 656 transitions. [2024-11-19 15:11:40,594 INFO L240 hiAutomatonCegarLoop]: Abstraction has 373 states and 656 transitions. [2024-11-19 15:11:40,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:11:40,596 INFO L425 stractBuchiCegarLoop]: Abstraction has 373 states and 656 transitions. [2024-11-19 15:11:40,596 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 15:11:40,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 656 transitions. [2024-11-19 15:11:40,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 177 [2024-11-19 15:11:40,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:11:40,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:11:40,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:11:40,603 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, 1, 1, 1] [2024-11-19 15:11:40,604 INFO L745 eck$LassoCheckResult]: Stem: 1561#$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(43, 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;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~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;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~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;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; 1562#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~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1, main_#t~post50#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;~ep14~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;~ep21~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;~ep23~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;~ep24~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;assume 0 == main_#t~nondet10#1 || 1 == main_#t~nondet10#1;~ep31~0 := (if 0 == main_#t~nondet10#1 % 256 then 0 else 1);havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;assume 0 == main_#t~nondet11#1 || 1 == main_#t~nondet11#1;~ep32~0 := (if 0 == main_#t~nondet11#1 % 256 then 0 else 1);havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume 0 == main_#t~nondet12#1 || 1 == main_#t~nondet12#1;~ep34~0 := (if 0 == main_#t~nondet12#1 % 256 then 0 else 1);havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;assume 0 == main_#t~nondet13#1 || 1 == main_#t~nondet13#1;~ep41~0 := (if 0 == main_#t~nondet13#1 % 256 then 0 else 1);havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;assume 0 == main_#t~nondet14#1 || 1 == main_#t~nondet14#1;~ep42~0 := (if 0 == main_#t~nondet14#1 % 256 then 0 else 1);havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume 0 == main_#t~nondet15#1 || 1 == main_#t~nondet15#1;~ep43~0 := (if 0 == main_#t~nondet15#1 % 256 then 0 else 1);havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;assume 0 == main_#t~nondet22#1 || 1 == main_#t~nondet22#1;~mode1~0 := (if 0 == main_#t~nondet22#1 % 256 then 0 else 1);havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~newmax1~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max2~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;~mode2~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~newmax2~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~mode3~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~newmax3~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~id4~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~r4~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~st4~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~nl4~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~m4~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~max4~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~mode4~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~newmax4~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~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_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~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_~r141~0#1 := (if 0 == ~ep14~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_~r241~0#1 := (if 0 == ~ep24~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);init_~r341~0#1 := (if 0 == ~ep34~0 % 256 then 0 else 1);init_~r411~0#1 := (if 0 == ~ep41~0 % 256 then 0 else 1);init_~r421~0#1 := (if 0 == ~ep42~0 % 256 then 0 else 1);init_~r431~0#1 := (if 0 == ~ep43~0 % 256 then 0 else 1); 1356#L441 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 1357#L452 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 1475#L462 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 1441#L473 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 1511#L483 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 1415#L494 init_~r142~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 1582#L504 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 1376#L515 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 1295#L525 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 1296#L536 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 1391#L546 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 1392#L557 init_~r242~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 1421#L567 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 1335#L578 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___5~0#1 then 0 else 1) % 256 then 0 else 1); 1485#L588 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 1343#L599 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___6~0#1 then 0 else 1) % 256 then 0 else 1); 1474#L609 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 1399#L620 init_~r342~0#1 := (if 0 == (if 0 == init_~tmp___7~0#1 then 0 else 1) % 256 then 0 else 1); 1439#L630 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 1409#L641 init_~r412~0#1 := (if 0 == (if 0 == init_~tmp___8~0#1 then 0 else 1) % 256 then 0 else 1); 1569#L651 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 1345#L662 init_~r422~0#1 := (if 0 == (if 0 == init_~tmp___9~0#1 then 0 else 1) % 256 then 0 else 1); 1506#L672 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 1507#L683 init_~r432~0#1 := (if 0 == (if 0 == init_~tmp___10~0#1 then 0 else 1) % 256 then 0 else 1); 1583#L693 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 1428#L704 init_~r123~0#1 := (if 0 == (if 0 == init_~tmp___11~0#1 then 0 else 1) % 256 then 0 else 1); 1541#L714 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 1324#L725 init_~r133~0#1 := (if 0 == (if 0 == init_~tmp___12~0#1 then 0 else 1) % 256 then 0 else 1); 1325#L735 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 1299#L746 init_~r143~0#1 := (if 0 == (if 0 == init_~tmp___13~0#1 then 0 else 1) % 256 then 0 else 1); 1469#L756 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 1320#L767 init_~r213~0#1 := (if 0 == (if 0 == init_~tmp___14~0#1 then 0 else 1) % 256 then 0 else 1); 1359#L777 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 1360#L788 init_~r233~0#1 := (if 0 == (if 0 == init_~tmp___15~0#1 then 0 else 1) % 256 then 0 else 1); 1523#L798 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 1536#L809 init_~r243~0#1 := (if 0 == (if 0 == init_~tmp___16~0#1 then 0 else 1) % 256 then 0 else 1); 1573#L819 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 1318#L830 init_~r313~0#1 := (if 0 == (if 0 == init_~tmp___17~0#1 then 0 else 1) % 256 then 0 else 1); 1502#L840 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 1303#L851 init_~r323~0#1 := (if 0 == (if 0 == init_~tmp___18~0#1 then 0 else 1) % 256 then 0 else 1); 1564#L861 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 1404#L872 init_~r343~0#1 := (if 0 == (if 0 == init_~tmp___19~0#1 then 0 else 1) % 256 then 0 else 1); 1567#L882 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 1380#L893 init_~r413~0#1 := (if 0 == (if 0 == init_~tmp___20~0#1 then 0 else 1) % 256 then 0 else 1); 1472#L903 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 1444#L914 init_~r423~0#1 := (if 0 == (if 0 == init_~tmp___21~0#1 then 0 else 1) % 256 then 0 else 1); 1471#L924 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 1461#L935 init_~r433~0#1 := (if 0 == (if 0 == init_~tmp___22~0#1 then 0 else 1) % 256 then 0 else 1); 1462#L945 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 1308#L945-1 init_#res#1 := init_~tmp___23~0#1; 1488#init_returnLabel#1 main_#t~ret48#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 1489#L21 assume !(0 == assume_abort_if_not_~cond#1); 1494#L20 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1548#L1271-2 [2024-11-19 15:11:40,604 INFO L747 eck$LassoCheckResult]: Loop: 1548#L1271-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 1647#L114 assume !(0 != ~mode1~0 % 256); 1646#L150 assume !(~r1~0 < 2); 1513#L150-1 ~mode1~0 := 1; 1644#L114-2 havoc node1_~newmax~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 1640#L178 assume !(0 != ~mode2~0 % 256); 1638#L214 assume !(~r2~0 < 3); 1632#L214-1 ~mode2~0 := 1; 1630#L178-2 havoc node2_~newmax~1#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 1626#L242 assume !(0 != ~mode3~0 % 256); 1621#L278 assume !(~r3~0 < 3); 1615#L278-1 ~mode3~0 := 1; 1612#L242-2 havoc node3_~newmax~2#1;assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; 1608#L306 assume !(0 != ~mode4~0 % 256); 1605#L342 assume !(~r4~0 < 3); 1599#L342-1 ~mode4~0 := 1; 1598#L306-2 havoc node4_~newmax~3#1;assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_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;~p24_old~0 := ~p24_new~0;~p24_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;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1597#L1138 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 1596#L1139 assume ~st1~0 + ~nl1~0 <= 1; 1595#L1140 assume ~st2~0 + ~nl2~0 <= 1; 1594#L1141 assume ~st3~0 + ~nl3~0 <= 1; 1593#L1142 assume ~st4~0 + ~nl4~0 <= 1; 1592#L1143 assume !(~r1~0 >= 3); 1520#L1146 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 1521#$Ultimate##714 assume ~r1~0 < 3; 1591#$Ultimate##718 assume !(~r1~0 >= 3); 1587#L1156 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; 1588#$Ultimate##722 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 1656#L1138-1 check_#res#1 := check_~tmp~1#1; 1653#check_returnLabel#1 main_#t~ret49#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret49#1;havoc main_#t~ret49#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; 1650#L1314 assume !(0 == assert_~arg#1 % 256); 1648#L1309 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post50#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post50#1;havoc main_#t~post50#1; 1548#L1271-2 [2024-11-19 15:11:40,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:11:40,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2064134942, now seen corresponding path program 3 times [2024-11-19 15:11:40,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:11:40,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974668442] [2024-11-19 15:11:40,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 15:11:40,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:11:40,654 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 15:11:40,655 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:11:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:11:40,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:11:40,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974668442] [2024-11-19 15:11:40,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974668442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:11:40,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:11:40,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 15:11:40,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519956109] [2024-11-19 15:11:40,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:11:40,836 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:11:40,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:11:40,837 INFO L85 PathProgramCache]: Analyzing trace with hash 300102500, now seen corresponding path program 1 times [2024-11-19 15:11:40,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:11:40,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024921908] [2024-11-19 15:11:40,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:11:40,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:11:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:11:40,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:11:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:11:40,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:11:41,951 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:11:41,952 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:11:41,952 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:11:41,952 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:11:41,952 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 15:11:41,952 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:11:41,953 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:11:41,953 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:11:41,953 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2024-11-19 15:11:41,953 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:11:41,954 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:11:41,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:41,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:41,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:41,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:41,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:41,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:42,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:42,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:42,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:42,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:42,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:42,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:42,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:42,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:42,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:42,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:42,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:42,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:42,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:42,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:42,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:42,661 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:11:42,662 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 15:11:42,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:11:42,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:11:42,674 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-11-19 15:11:42,677 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-11-19 15:11:42,678 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:11:42,678 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:11:42,695 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 15:11:42,696 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_node4_~newmax~3#1=0} Honda state: {ULTIMATE.start_node4_~newmax~3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 15:11:42,712 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-11-19 15:11:42,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:11:42,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:11:42,714 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-11-19 15:11:42,716 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-11-19 15:11:42,717 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:11:42,717 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:11:42,736 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 15:11:42,736 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_assert_#in~arg#1=0} Honda state: {ULTIMATE.start_assert_#in~arg#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 15:11:42,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-19 15:11:42,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:11:42,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:11:42,752 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-11-19 15:11:42,753 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-11-19 15:11:42,754 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:11:42,754 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:11:42,808 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-11-19 15:11:42,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:11:42,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:11:42,813 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-11-19 15:11:42,815 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-11-19 15:11:42,816 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 15:11:42,816 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:11:42,989 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 15:11:42,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 15:11:42,996 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:11:42,996 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:11:42,996 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:11:42,996 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:11:42,996 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 15:11:42,996 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:11:42,996 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:11:42,997 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:11:42,997 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2024-11-19 15:11:42,997 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:11:42,997 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:11:43,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:11:43,669 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:11:43,673 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 15:11:43,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:11:43,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:11:43,677 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-11-19 15:11:43,691 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-11-19 15:11:43,692 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-11-19 15:11:43,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:11:43,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:11:43,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:11:43,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:11:43,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:11:43,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:11:43,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:11:43,707 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:11:43,718 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-11-19 15:11:43,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:11:43,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:11:43,720 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-11-19 15:11:43,721 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-11-19 15:11:43,722 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-11-19 15:11:43,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:11:43,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:11:43,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:11:43,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:11:43,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:11:43,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:11:43,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:11:43,734 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:11:43,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-19 15:11:43,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:11:43,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:11:43,747 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-11-19 15:11:43,748 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-11-19 15:11:43,749 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-11-19 15:11:43,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:11:43,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:11:43,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:11:43,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:11:43,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:11:43,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:11:43,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:11:43,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:11:43,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-19 15:11:43,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:11:43,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:11:43,774 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-11-19 15:11:43,775 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-11-19 15:11:43,776 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-11-19 15:11:43,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:11:43,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:11:43,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:11:43,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:11:43,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:11:43,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:11:43,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:11:43,806 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:11:43,821 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-11-19 15:11:43,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:11:43,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:11:43,823 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-11-19 15:11:43,824 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-11-19 15:11:43,825 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-11-19 15:11:43,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:11:43,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:11:43,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:11:43,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:11:43,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:11:43,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:11:43,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:11:43,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:11:43,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-19 15:11:43,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:11:43,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:11:43,851 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-11-19 15:11:43,852 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-11-19 15:11:43,853 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-11-19 15:11:43,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:11:43,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:11:43,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:11:43,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:11:43,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:11:43,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:11:43,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:11:43,866 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 15:11:43,868 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 15:11:43,868 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 15:11:43,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:11:43,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:11:43,893 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-11-19 15:11:43,894 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-11-19 15:11:43,895 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 15:11:43,895 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 15:11:43,895 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 15:11:43,895 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 15 Supporting invariants [] [2024-11-19 15:11:43,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-19 15:11:43,909 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 15:11:43,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:11:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:11:44,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 15:11:44,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:11:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:11:44,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 15:11:44,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:11:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:11:44,351 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-11-19 15:11:44,353 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 373 states and 656 transitions. cyclomatic complexity: 284 Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:11:44,454 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 373 states and 656 transitions. cyclomatic complexity: 284. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 549 states and 950 transitions. Complement of second has 4 states. [2024-11-19 15:11:44,456 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-11-19 15:11:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:11:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2024-11-19 15:11:44,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 528 transitions. Stem has 55 letters. Loop has 32 letters. [2024-11-19 15:11:44,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:11:44,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 528 transitions. Stem has 87 letters. Loop has 32 letters. [2024-11-19 15:11:44,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:11:44,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 528 transitions. Stem has 55 letters. Loop has 64 letters. [2024-11-19 15:11:44,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:11:44,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549 states and 950 transitions. [2024-11-19 15:11:44,473 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 15:11:44,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549 states to 0 states and 0 transitions. [2024-11-19 15:11:44,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 15:11:44,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 15:11:44,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 15:11:44,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:11:44,473 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 15:11:44,473 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 15:11:44,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:11:44,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 15:11:44,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 15:11:44,474 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:11:44,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:11:44,474 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2024-11-19 15:11:44,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2024-11-19 15:11:44,474 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 15:11:44,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 15:11:44,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 15:11:44,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 15:11:44,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 15:11:44,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:11:44,475 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 15:11:44,475 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 15:11:44,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 15:11:44,475 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 15:11:44,475 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 15:11:44,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-19 15:11:44,475 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 15:11:44,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-19 15:11:44,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 03:11:44 BoogieIcfgContainer [2024-11-19 15:11:44,482 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 15:11:44,483 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 15:11:44,483 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 15:11:44,483 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 15:11:44,484 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:11:38" (3/4) ... [2024-11-19 15:11:44,486 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 15:11:44,487 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 15:11:44,487 INFO L158 Benchmark]: Toolchain (without parser) took 7615.68ms. Allocated memory was 165.7MB in the beginning and 245.4MB in the end (delta: 79.7MB). Free memory was 132.4MB in the beginning and 135.3MB in the end (delta: -2.8MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. [2024-11-19 15:11:44,488 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 104.9MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 15:11:44,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.35ms. Allocated memory is still 165.7MB. Free memory was 132.4MB in the beginning and 105.3MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-19 15:11:44,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.26ms. Allocated memory is still 165.7MB. Free memory was 105.3MB in the beginning and 99.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 15:11:44,489 INFO L158 Benchmark]: Boogie Preprocessor took 135.15ms. Allocated memory is still 165.7MB. Free memory was 99.0MB in the beginning and 92.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 15:11:44,489 INFO L158 Benchmark]: RCFGBuilder took 1266.44ms. Allocated memory is still 165.7MB. Free memory was 92.7MB in the beginning and 56.9MB in the end (delta: 35.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-19 15:11:44,489 INFO L158 Benchmark]: BuchiAutomizer took 5614.24ms. Allocated memory was 165.7MB in the beginning and 245.4MB in the end (delta: 79.7MB). Free memory was 56.9MB in the beginning and 135.3MB in the end (delta: -78.4MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2024-11-19 15:11:44,490 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 245.4MB. Free memory is still 135.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 15:11:44,492 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 104.9MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.35ms. Allocated memory is still 165.7MB. Free memory was 132.4MB in the beginning and 105.3MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.26ms. Allocated memory is still 165.7MB. Free memory was 105.3MB in the beginning and 99.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 135.15ms. Allocated memory is still 165.7MB. Free memory was 99.0MB in the beginning and 92.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1266.44ms. Allocated memory is still 165.7MB. Free memory was 92.7MB in the beginning and 56.9MB in the end (delta: 35.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 5614.24ms. Allocated memory was 165.7MB in the beginning and 245.4MB in the end (delta: 79.7MB). Free memory was 56.9MB in the beginning and 135.3MB in the end (delta: -78.4MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 245.4MB. Free memory is still 135.3MB. 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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (15 + ((long long) -2 * i2)) and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 820 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 819 mSDsluCounter, 3982 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2273 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 1709 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital160 mio100 ax100 hnf100 lsp46 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-19 15:11:44,518 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-11-19 15:11:44,719 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