./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cf92f342b2da275c63d151f2d4ed52683d7003506826ae2897efde5e3c66195f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 16:15:54,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 16:15:54,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 16:15:54,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 16:15:54,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 16:15:54,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 16:15:54,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 16:15:54,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 16:15:54,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 16:15:54,113 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 16:15:54,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 16:15:54,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 16:15:54,115 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 16:15:54,118 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 16:15:54,119 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 16:15:54,119 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 16:15:54,119 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 16:15:54,119 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 16:15:54,119 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 16:15:54,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 16:15:54,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 16:15:54,122 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 16:15:54,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 16:15:54,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 16:15:54,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 16:15:54,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 16:15:54,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 16:15:54,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 16:15:54,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 16:15:54,123 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 16:15:54,124 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 16:15:54,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 16:15:54,124 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 16:15:54,124 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 16:15:54,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 16:15:54,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 16:15:54,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 16:15:54,126 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 16:15:54,126 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 16:15:54,126 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 -> cf92f342b2da275c63d151f2d4ed52683d7003506826ae2897efde5e3c66195f [2024-11-09 16:15:54,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 16:15:54,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 16:15:54,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 16:15:54,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 16:15:54,364 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 16:15:54,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c [2024-11-09 16:15:55,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 16:15:55,819 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 16:15:55,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c [2024-11-09 16:15:55,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2ae3411/887505d8a6e9437d89eaab910ef46ae7/FLAG187e69610 [2024-11-09 16:15:56,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2ae3411/887505d8a6e9437d89eaab910ef46ae7 [2024-11-09 16:15:56,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 16:15:56,211 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 16:15:56,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 16:15:56,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 16:15:56,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 16:15:56,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:15:56" (1/1) ... [2024-11-09 16:15:56,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7473005d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:15:56, skipping insertion in model container [2024-11-09 16:15:56,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:15:56" (1/1) ... [2024-11-09 16:15:56,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 16:15:56,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 16:15:56,510 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 16:15:56,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 16:15:56,579 INFO L204 MainTranslator]: Completed translation [2024-11-09 16:15:56,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:15:56 WrapperNode [2024-11-09 16:15:56,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 16:15:56,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 16:15:56,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 16:15:56,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 16:15:56,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:15:56" (1/1) ... [2024-11-09 16:15:56,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:15:56" (1/1) ... [2024-11-09 16:15:56,622 INFO L138 Inliner]: procedures = 22, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 477 [2024-11-09 16:15:56,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 16:15:56,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 16:15:56,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 16:15:56,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 16:15:56,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:15:56" (1/1) ... [2024-11-09 16:15:56,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:15:56" (1/1) ... [2024-11-09 16:15:56,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:15:56" (1/1) ... [2024-11-09 16:15:56,658 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 16:15:56,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:15:56" (1/1) ... [2024-11-09 16:15:56,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:15:56" (1/1) ... [2024-11-09 16:15:56,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:15:56" (1/1) ... [2024-11-09 16:15:56,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:15:56" (1/1) ... [2024-11-09 16:15:56,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:15:56" (1/1) ... [2024-11-09 16:15:56,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:15:56" (1/1) ... [2024-11-09 16:15:56,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 16:15:56,687 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 16:15:56,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 16:15:56,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 16:15:56,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:15:56" (1/1) ... [2024-11-09 16:15:56,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:15:56,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:15:56,740 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:15:56,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 16:15:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 16:15:56,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 16:15:56,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 16:15:56,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 16:15:56,861 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 16:15:56,863 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 16:15:57,224 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-09 16:15:57,224 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 16:15:57,235 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 16:15:57,236 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 16:15:57,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:15:57 BoogieIcfgContainer [2024-11-09 16:15:57,236 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 16:15:57,237 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 16:15:57,237 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 16:15:57,240 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 16:15:57,241 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 16:15:57,241 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 04:15:56" (1/3) ... [2024-11-09 16:15:57,242 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58fced01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 04:15:57, skipping insertion in model container [2024-11-09 16:15:57,242 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 16:15:57,243 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:15:56" (2/3) ... [2024-11-09 16:15:57,243 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58fced01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 04:15:57, skipping insertion in model container [2024-11-09 16:15:57,243 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 16:15:57,243 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:15:57" (3/3) ... [2024-11-09 16:15:57,244 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c [2024-11-09 16:15:57,279 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 16:15:57,279 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 16:15:57,280 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 16:15:57,280 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 16:15:57,280 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 16:15:57,280 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 16:15:57,280 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 16:15:57,282 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 16:15:57,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.7692307692307692) internal successors, (230), 130 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:15:57,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2024-11-09 16:15:57,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:15:57,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:15:57,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:15:57,308 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:15:57,308 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 16:15:57,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.7692307692307692) internal successors, (230), 130 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:15:57,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2024-11-09 16:15:57,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:15:57,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:15:57,315 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:15:57,315 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:15:57,320 INFO L745 eck$LassoCheckResult]: Stem: 28#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(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;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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; 39#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~ret34#1, main_#t~ret35#1, main_#t~post36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;assume 0 == main_#t~nondet17#1 || 1 == main_#t~nondet17#1;~newmax1~0 := (if 0 == main_#t~nondet17#1 % 256 then 0 else 1);havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;assume 0 == main_#t~nondet24#1 || 1 == main_#t~nondet24#1;~mode2~0 := (if 0 == main_#t~nondet24#1 % 256 then 0 else 1);havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;assume 0 == main_#t~nondet25#1 || 1 == main_#t~nondet25#1;~newmax2~0 := (if 0 == main_#t~nondet25#1 % 256 then 0 else 1);havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~mode3~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;assume 0 == main_#t~nondet33#1 || 1 == main_#t~nondet33#1;~newmax3~0 := (if 0 == main_#t~nondet33#1 % 256 then 0 else 1);havoc main_#t~nondet33#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 31#L258true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 74#L261-1true init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 33#L271true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 76#L274-1true init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 58#L284true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 124#L287-1true init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 34#L297true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 44#L300-1true init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 67#L310true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 116#L313-1true init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 3#L323true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 20#L326-1true init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 75#L336true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 5#L336-1true init_#res#1 := init_~tmp___5~0#1; 88#init_returnLabel#1true main_#t~ret34#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; 94#L21true assume !(0 == assume_abort_if_not_~cond#1); 13#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;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 32#L568-2true [2024-11-09 16:15:57,321 INFO L747 eck$LassoCheckResult]: Loop: 32#L568-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 89#L82true assume !(0 != ~mode1~0 % 256); 64#L110true assume !(~r1~0 < 2); 16#L110-1true ~mode1~0 := 1; 123#L82-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; 106#L133true assume !(0 != ~mode2~0 % 256); 8#L161true assume !(~r2~0 < 2); 66#L161-1true ~mode2~0 := 1; 22#L133-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; 79#L184true assume !(0 != ~mode3~0 % 256); 68#L212true assume !(~r3~0 < 2); 96#L212-1true ~mode3~0 := 1; 78#L184-2true havoc node3_~newmax~2#1;assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 127#L465true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 122#L465-1true check_#res#1 := check_~tmp~1#1; 15#check_returnLabel#1true main_#t~ret35#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret35#1;havoc main_#t~ret35#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; 111#L598true assume !(0 == assert_~arg#1 % 256); 73#L593true havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post36#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post36#1;havoc main_#t~post36#1; 32#L568-2true [2024-11-09 16:15:57,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:15:57,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1744745224, now seen corresponding path program 1 times [2024-11-09 16:15:57,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:15:57,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059473117] [2024-11-09 16:15:57,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:15:57,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:15:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:15:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:15:57,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:15:57,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059473117] [2024-11-09 16:15:57,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059473117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:15:57,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:15:57,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 16:15:57,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718592306] [2024-11-09 16:15:57,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:15:57,666 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 16:15:57,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:15:57,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1547057266, now seen corresponding path program 1 times [2024-11-09 16:15:57,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:15:57,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718199557] [2024-11-09 16:15:57,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:15:57,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:15:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:15:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:15:57,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:15:57,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718199557] [2024-11-09 16:15:57,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718199557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:15:57,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:15:57,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 16:15:57,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436370690] [2024-11-09 16:15:57,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:15:57,797 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:15:57,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:15:57,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 16:15:57,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 16:15:57,868 INFO L87 Difference]: Start difference. First operand has 131 states, 130 states have (on average 1.7692307692307692) internal successors, (230), 130 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:15:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:15:57,956 INFO L93 Difference]: Finished difference Result 133 states and 229 transitions. [2024-11-09 16:15:57,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 229 transitions. [2024-11-09 16:15:57,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2024-11-09 16:15:57,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 125 states and 213 transitions. [2024-11-09 16:15:57,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2024-11-09 16:15:57,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2024-11-09 16:15:57,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 213 transitions. [2024-11-09 16:15:57,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:15:57,972 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 213 transitions. [2024-11-09 16:15:57,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 213 transitions. [2024-11-09 16:15:57,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-09 16:15:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.704) internal successors, (213), 124 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:15:57,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 213 transitions. [2024-11-09 16:15:57,999 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 213 transitions. [2024-11-09 16:15:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 16:15:58,003 INFO L425 stractBuchiCegarLoop]: Abstraction has 125 states and 213 transitions. [2024-11-09 16:15:58,003 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 16:15:58,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 213 transitions. [2024-11-09 16:15:58,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2024-11-09 16:15:58,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:15:58,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:15:58,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] [2024-11-09 16:15:58,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, 1, 1, 1] [2024-11-09 16:15:58,006 INFO L745 eck$LassoCheckResult]: Stem: 329#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(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;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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; 330#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~ret34#1, main_#t~ret35#1, main_#t~post36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;assume 0 == main_#t~nondet17#1 || 1 == main_#t~nondet17#1;~newmax1~0 := (if 0 == main_#t~nondet17#1 % 256 then 0 else 1);havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;assume 0 == main_#t~nondet24#1 || 1 == main_#t~nondet24#1;~mode2~0 := (if 0 == main_#t~nondet24#1 % 256 then 0 else 1);havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;assume 0 == main_#t~nondet25#1 || 1 == main_#t~nondet25#1;~newmax2~0 := (if 0 == main_#t~nondet25#1 % 256 then 0 else 1);havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~mode3~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;assume 0 == main_#t~nondet33#1 || 1 == main_#t~nondet33#1;~newmax3~0 := (if 0 == main_#t~nondet33#1 % 256 then 0 else 1);havoc main_#t~nondet33#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 334#L258 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 335#L261-1 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 338#L271 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 339#L274-1 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 364#L284 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 323#L287-1 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 341#L297 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 342#L300-1 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 355#L310 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 316#L313-1 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 278#L323 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 280#L326-1 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 313#L336 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 283#L336-1 init_#res#1 := init_~tmp___5~0#1; 284#init_returnLabel#1 main_#t~ret34#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; 387#L21 assume !(0 == assume_abort_if_not_~cond#1); 301#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;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 302#L568-2 [2024-11-09 16:15:58,006 INFO L747 eck$LassoCheckResult]: Loop: 302#L568-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 337#L82 assume !(0 != ~mode1~0 % 256); 370#L110 assume !(~r1~0 < 2); 286#L110-1 ~mode1~0 := 1; 307#L82-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; 392#L133 assume !(0 != ~mode2~0 % 256); 289#L161 assume !(~r2~0 < 2); 282#L161-1 ~mode2~0 := 1; 317#L133-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; 318#L184 assume !(0 != ~mode3~0 % 256); 373#L212 assume !(~r3~0 < 2); 374#L212-1 ~mode3~0 := 1; 379#L184-2 havoc node3_~newmax~2#1;assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 380#L465 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 401#L466 assume ~st1~0 + ~nl1~0 <= 1; 402#L467 assume ~st2~0 + ~nl2~0 <= 1; 397#L468 assume ~st3~0 + ~nl3~0 <= 1; 291#L469 assume ~r1~0 >= 2; 292#$Ultimate##274 assume ~r1~0 < 2; 328#$Ultimate##278 assume ~r1~0 >= 2; 350#$Ultimate##282 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 300#L465-1 check_#res#1 := check_~tmp~1#1; 305#check_returnLabel#1 main_#t~ret35#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret35#1;havoc main_#t~ret35#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; 306#L598 assume !(0 == assert_~arg#1 % 256); 378#L593 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post36#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post36#1;havoc main_#t~post36#1; 302#L568-2 [2024-11-09 16:15:58,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:15:58,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1744745224, now seen corresponding path program 2 times [2024-11-09 16:15:58,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:15:58,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858588706] [2024-11-09 16:15:58,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:15:58,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:15:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:15:58,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:15:58,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:15:58,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858588706] [2024-11-09 16:15:58,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858588706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:15:58,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:15:58,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 16:15:58,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179382361] [2024-11-09 16:15:58,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:15:58,139 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 16:15:58,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:15:58,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1448741168, now seen corresponding path program 1 times [2024-11-09 16:15:58,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:15:58,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075928990] [2024-11-09 16:15:58,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:15:58,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:15:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:15:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:15:58,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:15:58,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075928990] [2024-11-09 16:15:58,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075928990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:15:58,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:15:58,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 16:15:58,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819343461] [2024-11-09 16:15:58,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:15:58,163 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:15:58,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:15:58,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 16:15:58,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 16:15:58,164 INFO L87 Difference]: Start difference. First operand 125 states and 213 transitions. cyclomatic complexity: 89 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:15:58,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:15:58,221 INFO L93 Difference]: Finished difference Result 128 states and 215 transitions. [2024-11-09 16:15:58,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 215 transitions. [2024-11-09 16:15:58,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2024-11-09 16:15:58,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 125 states and 183 transitions. [2024-11-09 16:15:58,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2024-11-09 16:15:58,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2024-11-09 16:15:58,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 183 transitions. [2024-11-09 16:15:58,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:15:58,228 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 183 transitions. [2024-11-09 16:15:58,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 183 transitions. [2024-11-09 16:15:58,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-09 16:15:58,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.464) internal successors, (183), 124 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:15:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2024-11-09 16:15:58,236 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 183 transitions. [2024-11-09 16:15:58,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 16:15:58,237 INFO L425 stractBuchiCegarLoop]: Abstraction has 125 states and 183 transitions. [2024-11-09 16:15:58,237 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 16:15:58,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 183 transitions. [2024-11-09 16:15:58,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2024-11-09 16:15:58,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:15:58,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:15:58,239 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] [2024-11-09 16:15:58,239 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:15:58,240 INFO L745 eck$LassoCheckResult]: Stem: 591#$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;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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; 592#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~ret34#1, main_#t~ret35#1, main_#t~post36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;assume 0 == main_#t~nondet17#1 || 1 == main_#t~nondet17#1;~newmax1~0 := (if 0 == main_#t~nondet17#1 % 256 then 0 else 1);havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;assume 0 == main_#t~nondet24#1 || 1 == main_#t~nondet24#1;~mode2~0 := (if 0 == main_#t~nondet24#1 % 256 then 0 else 1);havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;assume 0 == main_#t~nondet25#1 || 1 == main_#t~nondet25#1;~newmax2~0 := (if 0 == main_#t~nondet25#1 % 256 then 0 else 1);havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~mode3~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;assume 0 == main_#t~nondet33#1 || 1 == main_#t~nondet33#1;~newmax3~0 := (if 0 == main_#t~nondet33#1 % 256 then 0 else 1);havoc main_#t~nondet33#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 596#L258 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 597#L261-1 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 600#L271 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 601#L274-1 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 626#L284 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 588#L287-1 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 603#L297 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 604#L300-1 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 617#L310 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 578#L313-1 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 540#L323 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 542#L326-1 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 575#L336 assume ~id1~0 != ~id2~0; 639#L337 assume ~id1~0 != ~id3~0; 618#L338 assume ~id2~0 != ~id3~0; 619#L339 assume ~id1~0 >= 0; 652#L340 assume ~id2~0 >= 0; 648#L341 assume ~id3~0 >= 0; 608#L342 assume 0 == ~r1~0; 609#L343 assume 0 == ~r2~0; 593#L344 assume 0 == ~r3~0; 594#L345 assume 0 != init_~r122~0#1 % 256; 614#L346 assume 0 != init_~r132~0#1 % 256; 615#L347 assume 0 != init_~r212~0#1 % 256; 656#L348 assume 0 != init_~r232~0#1 % 256; 643#L349 assume 0 != init_~r312~0#1 % 256; 644#L350 assume 0 != init_~r322~0#1 % 256; 632#L351 assume ~max1~0 == ~id1~0; 633#L352 assume ~max2~0 == ~id2~0; 651#L353 assume ~max3~0 == ~id3~0; 624#L354 assume 0 == ~st1~0; 610#L355 assume 0 == ~st2~0; 611#L356 assume 0 == ~st3~0; 623#L357 assume 0 == ~nl1~0; 556#L358 assume 0 == ~nl2~0; 557#L359 assume 0 == ~nl3~0; 565#L360 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 566#L361 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 638#L362 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296); 661#L363 assume 0 != ~newmax1~0 % 256; 662#L364 assume 0 != ~newmax2~0 % 256; 620#L365 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; 545#L336-1 init_#res#1 := init_~tmp___5~0#1; 546#init_returnLabel#1 main_#t~ret34#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; 649#L21 assume !(0 == assume_abort_if_not_~cond#1); 563#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;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 564#L568-2 [2024-11-09 16:15:58,240 INFO L747 eck$LassoCheckResult]: Loop: 564#L568-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 599#L82 assume !(0 != ~mode1~0 % 256); 634#L110 assume !(~r1~0 < 2); 548#L110-1 ~mode1~0 := 1; 569#L82-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; 654#L133 assume !(0 != ~mode2~0 % 256); 551#L161 assume !(~r2~0 < 2); 544#L161-1 ~mode2~0 := 1; 579#L133-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; 580#L184 assume !(0 != ~mode3~0 % 256); 635#L212 assume !(~r3~0 < 2); 636#L212-1 ~mode3~0 := 1; 641#L184-2 havoc node3_~newmax~2#1;assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 642#L465 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 663#L466 assume ~st1~0 + ~nl1~0 <= 1; 664#L467 assume ~st2~0 + ~nl2~0 <= 1; 659#L468 assume ~st3~0 + ~nl3~0 <= 1; 553#L469 assume ~r1~0 >= 2; 554#$Ultimate##274 assume ~r1~0 < 2; 590#$Ultimate##278 assume ~r1~0 >= 2; 612#$Ultimate##282 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 562#L465-1 check_#res#1 := check_~tmp~1#1; 567#check_returnLabel#1 main_#t~ret35#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret35#1;havoc main_#t~ret35#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; 568#L598 assume !(0 == assert_~arg#1 % 256); 640#L593 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post36#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post36#1;havoc main_#t~post36#1; 564#L568-2 [2024-11-09 16:15:58,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:15:58,240 INFO L85 PathProgramCache]: Analyzing trace with hash 431062094, now seen corresponding path program 1 times [2024-11-09 16:15:58,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:15:58,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192065968] [2024-11-09 16:15:58,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:15:58,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:15:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:15:58,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:15:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:15:58,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:15:58,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:15:58,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1448741168, now seen corresponding path program 2 times [2024-11-09 16:15:58,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:15:58,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875457125] [2024-11-09 16:15:58,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:15:58,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:15:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:15:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:15:58,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:15:58,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875457125] [2024-11-09 16:15:58,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875457125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:15:58,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:15:58,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 16:15:58,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314357931] [2024-11-09 16:15:58,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:15:58,460 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:15:58,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:15:58,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 16:15:58,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 16:15:58,461 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. cyclomatic complexity: 59 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:15:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:15:58,500 INFO L93 Difference]: Finished difference Result 174 states and 257 transitions. [2024-11-09 16:15:58,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 257 transitions. [2024-11-09 16:15:58,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 114 [2024-11-09 16:15:58,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 257 transitions. [2024-11-09 16:15:58,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2024-11-09 16:15:58,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2024-11-09 16:15:58,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 257 transitions. [2024-11-09 16:15:58,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:15:58,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 174 states and 257 transitions. [2024-11-09 16:15:58,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 257 transitions. [2024-11-09 16:15:58,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-09 16:15:58,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.4770114942528736) internal successors, (257), 173 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:15:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 257 transitions. [2024-11-09 16:15:58,510 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 257 transitions. [2024-11-09 16:15:58,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 16:15:58,510 INFO L425 stractBuchiCegarLoop]: Abstraction has 174 states and 257 transitions. [2024-11-09 16:15:58,510 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 16:15:58,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 257 transitions. [2024-11-09 16:15:58,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 114 [2024-11-09 16:15:58,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:15:58,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:15:58,512 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] [2024-11-09 16:15:58,513 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:15:58,513 INFO L745 eck$LassoCheckResult]: Stem: 897#$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;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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; 898#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~ret34#1, main_#t~ret35#1, main_#t~post36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;assume 0 == main_#t~nondet17#1 || 1 == main_#t~nondet17#1;~newmax1~0 := (if 0 == main_#t~nondet17#1 % 256 then 0 else 1);havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;assume 0 == main_#t~nondet24#1 || 1 == main_#t~nondet24#1;~mode2~0 := (if 0 == main_#t~nondet24#1 % 256 then 0 else 1);havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;assume 0 == main_#t~nondet25#1 || 1 == main_#t~nondet25#1;~newmax2~0 := (if 0 == main_#t~nondet25#1 % 256 then 0 else 1);havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~mode3~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;assume 0 == main_#t~nondet33#1 || 1 == main_#t~nondet33#1;~newmax3~0 := (if 0 == main_#t~nondet33#1 % 256 then 0 else 1);havoc main_#t~nondet33#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 902#L258 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 903#L261-1 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 906#L271 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 907#L274-1 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 935#L284 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 894#L287-1 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 909#L297 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 910#L300-1 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 924#L310 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 884#L313-1 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 845#L323 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 847#L326-1 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 881#L336 assume ~id1~0 != ~id2~0; 948#L337 assume ~id1~0 != ~id3~0; 925#L338 assume ~id2~0 != ~id3~0; 926#L339 assume ~id1~0 >= 0; 962#L340 assume ~id2~0 >= 0; 957#L341 assume ~id3~0 >= 0; 916#L342 assume 0 == ~r1~0; 917#L343 assume 0 == ~r2~0; 899#L344 assume 0 == ~r3~0; 900#L345 assume 0 != init_~r122~0#1 % 256; 921#L346 assume 0 != init_~r132~0#1 % 256; 922#L347 assume 0 != init_~r212~0#1 % 256; 966#L348 assume 0 != init_~r232~0#1 % 256; 952#L349 assume 0 != init_~r312~0#1 % 256; 953#L350 assume 0 != init_~r322~0#1 % 256; 942#L351 assume ~max1~0 == ~id1~0; 943#L352 assume ~max2~0 == ~id2~0; 961#L353 assume ~max3~0 == ~id3~0; 931#L354 assume 0 == ~st1~0; 918#L355 assume 0 == ~st2~0; 919#L356 assume 0 == ~st3~0; 930#L357 assume 0 == ~nl1~0; 860#L358 assume 0 == ~nl2~0; 861#L359 assume 0 == ~nl3~0; 869#L360 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 870#L361 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 947#L362 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296); 971#L363 assume 0 != ~newmax1~0 % 256; 973#L364 assume 0 != ~newmax2~0 % 256; 927#L365 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; 850#L336-1 init_#res#1 := init_~tmp___5~0#1; 851#init_returnLabel#1 main_#t~ret34#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; 958#L21 assume !(0 == assume_abort_if_not_~cond#1); 867#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;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 868#L568-2 [2024-11-09 16:15:58,513 INFO L747 eck$LassoCheckResult]: Loop: 868#L568-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 905#L82 assume !(0 != ~mode1~0 % 256); 959#L110 assume ~r1~0 < 2; 876#L111 assume !(0 != ~ep12~0 % 256); 878#L111-1 assume !(0 != ~ep13~0 % 256); 853#L110-1 ~mode1~0 := 1; 880#L82-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; 1008#L133 assume !(0 != ~mode2~0 % 256); 1006#L161 assume !(~r2~0 < 2); 1002#L161-1 ~mode2~0 := 1; 998#L133-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; 995#L184 assume !(0 != ~mode3~0 % 256); 991#L212 assume !(~r3~0 < 2); 988#L212-1 ~mode3~0 := 1; 986#L184-2 havoc node3_~newmax~2#1;assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 985#L465 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 984#L466 assume ~st1~0 + ~nl1~0 <= 1; 982#L467 assume ~st2~0 + ~nl2~0 <= 1; 980#L468 assume ~st3~0 + ~nl3~0 <= 1; 978#L469 assume !(~r1~0 >= 2); 914#L472 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 915#$Ultimate##274 assume ~r1~0 < 2; 1018#$Ultimate##278 assume !(~r1~0 >= 2); 933#L482 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 934#$Ultimate##282 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 972#L465-1 check_#res#1 := check_~tmp~1#1; 871#check_returnLabel#1 main_#t~ret35#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret35#1;havoc main_#t~ret35#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; 872#L598 assume !(0 == assert_~arg#1 % 256); 949#L593 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post36#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post36#1;havoc main_#t~post36#1; 868#L568-2 [2024-11-09 16:15:58,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:15:58,514 INFO L85 PathProgramCache]: Analyzing trace with hash 431062094, now seen corresponding path program 2 times [2024-11-09 16:15:58,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:15:58,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234816642] [2024-11-09 16:15:58,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:15:58,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:15:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:15:58,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:15:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:15:58,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:15:58,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:15:58,681 INFO L85 PathProgramCache]: Analyzing trace with hash 18424738, now seen corresponding path program 1 times [2024-11-09 16:15:58,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:15:58,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782405508] [2024-11-09 16:15:58,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:15:58,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:15:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:15:58,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:15:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:15:58,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:15:58,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:15:58,702 INFO L85 PathProgramCache]: Analyzing trace with hash 135841397, now seen corresponding path program 1 times [2024-11-09 16:15:58,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:15:58,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979192660] [2024-11-09 16:15:58,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:15:58,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:15:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:15:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:15:58,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:15:58,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979192660] [2024-11-09 16:15:58,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979192660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:15:58,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:15:58,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 16:15:58,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961675564] [2024-11-09 16:15:58,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:15:59,260 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:15:59,260 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:15:59,260 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:15:59,261 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:15:59,261 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 16:15:59,261 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:15:59,261 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:15:59,262 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:15:59,262 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2024-11-09 16:15:59,262 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:15:59,262 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:15:59,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,679 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:15:59,680 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 16:15:59,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:15:59,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:15:59,685 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-09 16:15:59,687 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-09 16:15:59,687 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:15:59,688 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:15:59,713 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 16:15:59,714 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=0} Honda state: {~ep12~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 16:15:59,728 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-09 16:15:59,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:15:59,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:15:59,730 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-09 16:15:59,732 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-09 16:15:59,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:15:59,733 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:15:59,757 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-09 16:15:59,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:15:59,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:15:59,762 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-09 16:15:59,763 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-09 16:15:59,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 16:15:59,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:15:59,847 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 16:15:59,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-09 16:15:59,852 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:15:59,852 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:15:59,852 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:15:59,852 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:15:59,852 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 16:15:59,853 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:15:59,853 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:15:59,853 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:15:59,853 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2024-11-09 16:15:59,853 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:15:59,853 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:15:59,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:15:59,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:16:00,213 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:16:00,221 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 16:16:00,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,228 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-09 16:16:00,231 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-09 16:16:00,233 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-09 16:16:00,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:16:00,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:16:00,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:16:00,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:16:00,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:16:00,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:16:00,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:16:00,247 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:16:00,258 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-09 16:16:00,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,260 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-09 16:16:00,261 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-09 16:16:00,262 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-09 16:16:00,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:16:00,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:16:00,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:16:00,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:16:00,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:16:00,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:16:00,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:16:00,282 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:16:00,303 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-09 16:16:00,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,305 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-09 16:16:00,309 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-09 16:16:00,310 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-09 16:16:00,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:16:00,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:16:00,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:16:00,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:16:00,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:16:00,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:16:00,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:16:00,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:16:00,337 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-09 16:16:00,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,340 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-09 16:16:00,341 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-09 16:16:00,341 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-09 16:16:00,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:16:00,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:16:00,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:16:00,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:16:00,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:16:00,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:16:00,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:16:00,355 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:16:00,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-09 16:16:00,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,371 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-09 16:16:00,372 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-09 16:16:00,373 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-09 16:16:00,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:16:00,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:16:00,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:16:00,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:16:00,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:16:00,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:16:00,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:16:00,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:16:00,394 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-09 16:16:00,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,396 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-09 16:16:00,397 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-09 16:16:00,398 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-09 16:16:00,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:16:00,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:16:00,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:16:00,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:16:00,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:16:00,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:16:00,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:16:00,409 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:16:00,420 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-09 16:16:00,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,421 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-09 16:16:00,423 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-09 16:16:00,423 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-09 16:16:00,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:16:00,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:16:00,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:16:00,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:16:00,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:16:00,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:16:00,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:16:00,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:16:00,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-09 16:16:00,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,450 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-09 16:16:00,451 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-09 16:16:00,451 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-09 16:16:00,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:16:00,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:16:00,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:16:00,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:16:00,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:16:00,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:16:00,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:16:00,464 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:16:00,474 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-09 16:16:00,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,475 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:16:00,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-09 16:16:00,477 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-09 16:16:00,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:16:00,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:16:00,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:16:00,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:16:00,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:16:00,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:16:00,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:16:00,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:16:00,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-09 16:16:00,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,504 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:16:00,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-09 16:16:00,506 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-09 16:16:00,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:16:00,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:16:00,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:16:00,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:16:00,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:16:00,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:16:00,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:16:00,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:16:00,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-09 16:16:00,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,530 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:16:00,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-09 16:16:00,532 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-09 16:16:00,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:16:00,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:16:00,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:16:00,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:16:00,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:16:00,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:16:00,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:16:00,544 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:16:00,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-09 16:16:00,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,556 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:16:00,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-09 16:16:00,559 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-09 16:16:00,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:16:00,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:16:00,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:16:00,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:16:00,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:16:00,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:16:00,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:16:00,575 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:16:00,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-09 16:16:00,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,587 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:16:00,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-09 16:16:00,589 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-09 16:16:00,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:16:00,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:16:00,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:16:00,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:16:00,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:16:00,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:16:00,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:16:00,601 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:16:00,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-09 16:16:00,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,613 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:16:00,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 16:16:00,615 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-09 16:16:00,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:16:00,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:16:00,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:16:00,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:16:00,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:16:00,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:16:00,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:16:00,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:16:00,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-09 16:16:00,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,638 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:16:00,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-09 16:16:00,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:16:00,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:16:00,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:16:00,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:16:00,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:16:00,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:16:00,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:16:00,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:16:00,654 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:16:00,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-09 16:16:00,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,666 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:16:00,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-09 16:16:00,669 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-09 16:16:00,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:16:00,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:16:00,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:16:00,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:16:00,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:16:00,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:16:00,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:16:00,681 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:16:00,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-09 16:16:00,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,693 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:16:00,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-09 16:16:00,695 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-09 16:16:00,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:16:00,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:16:00,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:16:00,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:16:00,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:16:00,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:16:00,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:16:00,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:16:00,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-09 16:16:00,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,718 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:16:00,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-09 16:16:00,720 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-09 16:16:00,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:16:00,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:16:00,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:16:00,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:16:00,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:16:00,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:16:00,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:16:00,732 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:16:00,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-09 16:16:00,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,743 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:16:00,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-09 16:16:00,745 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-09 16:16:00,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:16:00,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:16:00,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:16:00,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:16:00,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:16:00,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:16:00,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:16:00,757 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 16:16:00,759 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 16:16:00,759 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 16:16:00,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:16:00,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:16:00,765 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:16:00,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-09 16:16:00,771 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 16:16:00,771 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 16:16:00,771 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 16:16:00,772 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 11 Supporting invariants [] [2024-11-09 16:16:00,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-09 16:16:00,784 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 16:16:00,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:16:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:16:00,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 16:16:00,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:16:00,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-09 16:16:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:16:01,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 16:16:01,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:16:01,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:16:01,112 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-09 16:16:01,113 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 174 states and 257 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:16:01,152 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 174 states and 257 transitions. cyclomatic complexity: 84. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 287 states and 436 transitions. Complement of second has 4 states. [2024-11-09 16:16:01,153 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-09 16:16:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:16:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2024-11-09 16:16:01,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 48 letters. Loop has 29 letters. [2024-11-09 16:16:01,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:16:01,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 77 letters. Loop has 29 letters. [2024-11-09 16:16:01,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:16:01,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 48 letters. Loop has 58 letters. [2024-11-09 16:16:01,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:16:01,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 287 states and 436 transitions. [2024-11-09 16:16:01,159 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 16:16:01,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 287 states to 0 states and 0 transitions. [2024-11-09 16:16:01,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 16:16:01,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 16:16:01,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 16:16:01,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:16:01,160 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 16:16:01,160 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 16:16:01,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:16:01,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 16:16:01,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 16:16:01,160 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:16:01,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:16:01,161 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2024-11-09 16:16:01,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2024-11-09 16:16:01,161 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 16:16:01,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 16:16:01,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 16:16:01,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 16:16:01,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 16:16:01,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:16:01,162 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 16:16:01,162 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 16:16:01,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 16:16:01,162 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 16:16:01,162 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 16:16:01,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 16:16:01,162 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 16:16:01,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 16:16:01,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 04:16:01 BoogieIcfgContainer [2024-11-09 16:16:01,168 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 16:16:01,168 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 16:16:01,168 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 16:16:01,168 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 16:16:01,169 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:15:57" (3/4) ... [2024-11-09 16:16:01,170 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 16:16:01,171 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 16:16:01,172 INFO L158 Benchmark]: Toolchain (without parser) took 4960.65ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 94.6MB in the beginning and 231.6MB in the end (delta: -137.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 16:16:01,172 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 16:16:01,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.98ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 94.5MB in the beginning and 187.8MB in the end (delta: -93.3MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-11-09 16:16:01,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.51ms. Allocated memory is still 228.6MB. Free memory was 187.8MB in the beginning and 183.9MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 16:16:01,173 INFO L158 Benchmark]: Boogie Preprocessor took 63.38ms. Allocated memory is still 228.6MB. Free memory was 183.9MB in the beginning and 179.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 16:16:01,173 INFO L158 Benchmark]: RCFGBuilder took 548.92ms. Allocated memory is still 228.6MB. Free memory was 179.7MB in the beginning and 140.9MB in the end (delta: 38.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-09 16:16:01,173 INFO L158 Benchmark]: BuchiAutomizer took 3930.77ms. Allocated memory was 228.6MB in the beginning and 302.0MB in the end (delta: 73.4MB). Free memory was 140.9MB in the beginning and 231.6MB in the end (delta: -90.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 16:16:01,173 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 302.0MB. Free memory is still 231.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 16:16:01,174 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.17ms. Allocated memory is still 167.8MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.98ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 94.5MB in the beginning and 187.8MB in the end (delta: -93.3MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.51ms. Allocated memory is still 228.6MB. Free memory was 187.8MB in the beginning and 183.9MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.38ms. Allocated memory is still 228.6MB. Free memory was 183.9MB in the beginning and 179.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 548.92ms. Allocated memory is still 228.6MB. Free memory was 179.7MB in the beginning and 140.9MB in the end (delta: 38.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 3930.77ms. Allocated memory was 228.6MB in the beginning and 302.0MB in the end (delta: 73.4MB). Free memory was 140.9MB in the beginning and 231.6MB in the end (delta: -90.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 302.0MB. Free memory is still 231.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i2) + 11) and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 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, 344 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 343 mSDsluCounter, 2317 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1521 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 796 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital116 mio100 ax100 hnf100 lsp32 ukn100 mio100 lsp100 div123 bol100 ite100 ukn100 eq182 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-09 16:16:01,197 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