./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label58.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/eca-rers2012/Problem01_label58.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 a5f87b8357f03d9a8be5e507a55ad1b488f3fb22c6f294c5cc7e1ddb521502de --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:05:05,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:05:05,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:05:05,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:05:05,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:05:05,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:05:05,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:05:05,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:05:05,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:05:05,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:05:05,168 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:05:05,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:05:05,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:05:05,168 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:05:05,168 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:05:05,169 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:05:05,169 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:05:05,169 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:05:05,169 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:05:05,169 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:05:05,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:05:05,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:05:05,169 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:05:05,169 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:05:05,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:05:05,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:05:05,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:05:05,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:05:05,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:05:05,170 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:05:05,170 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:05:05,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:05:05,170 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:05:05,170 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:05:05,170 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:05:05,170 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:05:05,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:05:05,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:05:05,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:05:05,171 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:05:05,171 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> a5f87b8357f03d9a8be5e507a55ad1b488f3fb22c6f294c5cc7e1ddb521502de [2025-03-17 20:05:05,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:05:05,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:05:05,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:05:05,405 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:05:05,405 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:05:05,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label58.c [2025-03-17 20:05:06,545 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7b00dc1e/8587acdc702b46b295d0b97b1a2986a7/FLAG758356e8c [2025-03-17 20:05:06,844 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:05:06,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label58.c [2025-03-17 20:05:06,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7b00dc1e/8587acdc702b46b295d0b97b1a2986a7/FLAG758356e8c [2025-03-17 20:05:07,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7b00dc1e/8587acdc702b46b295d0b97b1a2986a7 [2025-03-17 20:05:07,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:05:07,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:05:07,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:05:07,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:05:07,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:05:07,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:05:07" (1/1) ... [2025-03-17 20:05:07,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b61bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:05:07, skipping insertion in model container [2025-03-17 20:05:07,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:05:07" (1/1) ... [2025-03-17 20:05:07,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:05:07,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:05:07,378 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:05:07,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:05:07,456 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:05:07,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:05:07 WrapperNode [2025-03-17 20:05:07,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:05:07,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:05:07,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:05:07,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:05:07,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:05:07" (1/1) ... [2025-03-17 20:05:07,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:05:07" (1/1) ... [2025-03-17 20:05:07,502 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 654 [2025-03-17 20:05:07,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:05:07,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:05:07,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:05:07,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:05:07,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:05:07" (1/1) ... [2025-03-17 20:05:07,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:05:07" (1/1) ... [2025-03-17 20:05:07,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:05:07" (1/1) ... [2025-03-17 20:05:07,531 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]. [2025-03-17 20:05:07,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:05:07" (1/1) ... [2025-03-17 20:05:07,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:05:07" (1/1) ... [2025-03-17 20:05:07,550 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:05:07" (1/1) ... [2025-03-17 20:05:07,554 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:05:07" (1/1) ... [2025-03-17 20:05:07,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:05:07" (1/1) ... [2025-03-17 20:05:07,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:05:07" (1/1) ... [2025-03-17 20:05:07,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:05:07,566 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:05:07,567 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:05:07,567 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:05:07,569 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:05:07" (1/1) ... [2025-03-17 20:05:07,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:07,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:07,598 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) [2025-03-17 20:05:07,607 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 [2025-03-17 20:05:07,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 20:05:07,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 20:05:07,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:05:07,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:05:07,679 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:05:07,681 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:05:08,350 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-17 20:05:08,351 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:05:08,364 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:05:08,366 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:05:08,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:05:08 BoogieIcfgContainer [2025-03-17 20:05:08,366 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:05:08,367 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:05:08,367 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:05:08,371 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:05:08,371 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:05:08,371 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:05:07" (1/3) ... [2025-03-17 20:05:08,372 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cd6177f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:05:08, skipping insertion in model container [2025-03-17 20:05:08,372 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:05:08,372 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:05:07" (2/3) ... [2025-03-17 20:05:08,372 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cd6177f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:05:08, skipping insertion in model container [2025-03-17 20:05:08,372 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:05:08,372 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:05:08" (3/3) ... [2025-03-17 20:05:08,373 INFO L363 chiAutomizerObserver]: Analyzing ICFG Problem01_label58.c [2025-03-17 20:05:08,413 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:05:08,413 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:05:08,413 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:05:08,413 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:05:08,413 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:05:08,414 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:05:08,414 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:05:08,414 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:05:08,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 135 states, 134 states have (on average 1.962686567164179) internal successors, (263), 134 states have internal predecessors, (263), 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) [2025-03-17 20:05:08,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 131 [2025-03-17 20:05:08,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:05:08,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:05:08,435 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:05:08,435 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:05:08,435 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:05:08,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 135 states, 134 states have (on average 1.962686567164179) internal successors, (263), 134 states have internal predecessors, (263), 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) [2025-03-17 20:05:08,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 131 [2025-03-17 20:05:08,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:05:08,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:05:08,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:05:08,442 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:05:08,447 INFO L752 eck$LassoCheckResult]: Stem: "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(20, 2);call #Ultimate.allocInit(12, 3);~a~0 := 1;~d~0 := 4;~e~0 := 5;~f~0 := 6;~c~0 := 3;~b~0 := 2;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a17~0 := 1;~a7~0 := 0;~a20~0 := 1;~a8~0 := 15;~a12~0 := 8;~a16~0 := 5;~a21~0 := 1;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1;" [2025-03-17 20:05:08,448 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume (15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0;~a16~0 := 5;~a20~0 := 0;calculate_output_#res#1 := 24;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" [2025-03-17 20:05:08,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:08,451 INFO L85 PathProgramCache]: Analyzing trace with hash 362, now seen corresponding path program 1 times [2025-03-17 20:05:08,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:05:08,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192449492] [2025-03-17 20:05:08,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:05:08,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:05:08,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:05:08,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:05:08,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:08,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:08,509 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:05:08,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:05:08,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:05:08,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:08,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:08,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:05:08,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:08,531 INFO L85 PathProgramCache]: Analyzing trace with hash 11043906, now seen corresponding path program 1 times [2025-03-17 20:05:08,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:05:08,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871895348] [2025-03-17 20:05:08,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:05:08,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:05:08,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:05:08,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:05:08,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:08,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:08,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:05:08,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:05:08,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:05:08,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:08,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:08,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:05:08,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:08,557 INFO L85 PathProgramCache]: Analyzing trace with hash 344434987, now seen corresponding path program 1 times [2025-03-17 20:05:08,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:05:08,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125682759] [2025-03-17 20:05:08,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:05:08,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:05:08,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:05:08,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:05:08,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:08,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:08,580 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:05:08,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:05:08,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:05:08,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:08,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:08,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:05:08,737 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:05:08,737 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:05:08,737 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:05:08,737 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:05:08,737 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:05:08,738 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:08,738 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:05:08,738 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:05:08,738 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label58.c_Iteration1_Loop [2025-03-17 20:05:08,738 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:05:08,738 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:05:08,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:08,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:08,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:08,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:08,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:08,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:08,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:08,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:08,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:08,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:08,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:08,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:08,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:08,896 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:05:08,897 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:05:08,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:08,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:08,900 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) [2025-03-17 20:05:08,901 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 [2025-03-17 20:05:08,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:08,903 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:08,917 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:08,917 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_~input#1=0} Honda state: {ULTIMATE.start_calculate_output_~input#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:08,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:08,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:08,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:08,928 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) [2025-03-17 20:05:08,930 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 [2025-03-17 20:05:08,932 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:08,932 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:08,943 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:08,943 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a12~0=8} Honda state: {~a12~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:08,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:08,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:08,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:08,952 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) [2025-03-17 20:05:08,954 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 [2025-03-17 20:05:08,955 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:08,955 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:08,966 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:08,966 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=1} Honda state: {~a17~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:08,972 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 [2025-03-17 20:05:08,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:08,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:08,975 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) [2025-03-17 20:05:08,977 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 [2025-03-17 20:05:08,979 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:08,979 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:08,999 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:08,999 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a16~0=5} Honda state: {~a16~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:09,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:09,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,050 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) [2025-03-17 20:05:09,082 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 [2025-03-17 20:05:09,085 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:09,085 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:09,097 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:09,098 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input#1=0} Honda state: {ULTIMATE.start_calculate_output_#in~input#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:09,104 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 [2025-03-17 20:05:09,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,106 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) [2025-03-17 20:05:09,107 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 [2025-03-17 20:05:09,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:09,110 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:09,120 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:09,121 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret7#1=0} Honda state: {ULTIMATE.start_main_#t~ret7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:09,127 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 [2025-03-17 20:05:09,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,129 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) [2025-03-17 20:05:09,131 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 [2025-03-17 20:05:09,132 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:09,133 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:09,144 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:09,144 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0#1=0} Honda state: {ULTIMATE.start_main_~input~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:09,150 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 [2025-03-17 20:05:09,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,153 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) [2025-03-17 20:05:09,154 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 [2025-03-17 20:05:09,155 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:09,156 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:09,167 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:09,167 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet6#1=0} Honda state: {ULTIMATE.start_main_#t~nondet6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:09,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:09,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,179 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) [2025-03-17 20:05:09,180 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 [2025-03-17 20:05:09,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:09,180 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:09,199 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:09,199 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a7~0=4} Honda state: {~a7~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:09,205 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 [2025-03-17 20:05:09,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,207 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) [2025-03-17 20:05:09,209 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 [2025-03-17 20:05:09,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:09,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:09,222 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:09,222 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:09,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:09,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,232 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) [2025-03-17 20:05:09,233 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 [2025-03-17 20:05:09,234 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:09,235 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:09,247 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:09,247 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a8~0=15} Honda state: {~a8~0=15} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:09,253 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 [2025-03-17 20:05:09,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,255 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) [2025-03-17 20:05:09,255 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 [2025-03-17 20:05:09,256 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:09,256 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:09,272 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 [2025-03-17 20:05:09,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,275 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) [2025-03-17 20:05:09,276 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 [2025-03-17 20:05:09,277 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:05:09,277 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:09,289 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:05:09,295 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 [2025-03-17 20:05:09,295 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:05:09,295 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:05:09,295 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:05:09,295 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:05:09,295 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:05:09,296 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,296 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:05:09,296 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:05:09,296 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label58.c_Iteration1_Loop [2025-03-17 20:05:09,296 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:05:09,296 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:05:09,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:09,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:09,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:09,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:09,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:09,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:09,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:09,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:09,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:09,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:09,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:09,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:09,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:09,418 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:05:09,421 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:05:09,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,423 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) [2025-03-17 20:05:09,425 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 [2025-03-17 20:05:09,426 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 [2025-03-17 20:05:09,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:09,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:09,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:09,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:09,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:09,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:09,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:09,442 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:09,448 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 [2025-03-17 20:05:09,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,450 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) [2025-03-17 20:05:09,452 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 [2025-03-17 20:05:09,453 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 [2025-03-17 20:05:09,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:09,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:09,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:09,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:09,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:09,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:09,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:09,466 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:09,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-17 20:05:09,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,473 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) [2025-03-17 20:05:09,474 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 [2025-03-17 20:05:09,479 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 [2025-03-17 20:05:09,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:09,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:09,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:09,489 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 20:05:09,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:09,491 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-17 20:05:09,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:09,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:09,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-17 20:05:09,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,502 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) [2025-03-17 20:05:09,503 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 [2025-03-17 20:05:09,504 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 [2025-03-17 20:05:09,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:09,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:09,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:09,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:09,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:09,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:09,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:09,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:09,525 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 [2025-03-17 20:05:09,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,527 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) [2025-03-17 20:05:09,529 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 [2025-03-17 20:05:09,530 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 [2025-03-17 20:05:09,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:09,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:09,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:09,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:09,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:09,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:09,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:09,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:09,548 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 [2025-03-17 20:05:09,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,550 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) [2025-03-17 20:05:09,551 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 [2025-03-17 20:05:09,553 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 [2025-03-17 20:05:09,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:09,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:09,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:09,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:09,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:09,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:09,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:09,566 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:09,572 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 [2025-03-17 20:05:09,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,574 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) [2025-03-17 20:05:09,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-17 20:05:09,577 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 [2025-03-17 20:05:09,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:09,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:09,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:09,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:09,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:09,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:09,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:09,589 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:09,595 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 [2025-03-17 20:05:09,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,597 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) [2025-03-17 20:05:09,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 20:05:09,600 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 [2025-03-17 20:05:09,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:09,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:09,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:09,610 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 20:05:09,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:09,611 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-17 20:05:09,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:09,613 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:09,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:09,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,622 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) [2025-03-17 20:05:09,622 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 [2025-03-17 20:05:09,625 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 [2025-03-17 20:05:09,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:09,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:09,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:09,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:09,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:09,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:09,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:09,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:09,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:09,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,645 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) [2025-03-17 20:05:09,646 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 [2025-03-17 20:05:09,648 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 [2025-03-17 20:05:09,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:09,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:09,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:09,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:09,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:09,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:09,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:09,660 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:09,665 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 [2025-03-17 20:05:09,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,667 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:05:09,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 20:05:09,671 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 [2025-03-17 20:05:09,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:09,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:09,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:09,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:09,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:09,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:09,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:09,684 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:09,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:09,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,691 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:05:09,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 20:05:09,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 [2025-03-17 20:05:09,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:09,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:09,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:09,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:09,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:09,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:09,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:09,709 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:05:09,711 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:05:09,713 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 20:05:09,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:09,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:09,716 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:05:09,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-17 20:05:09,722 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:05:09,723 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:05:09,723 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:05:09,723 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a20~0) = 1*~a20~0 Supporting invariants [] [2025-03-17 20:05:09,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:09,732 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:05:09,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:09,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:05:09,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:05:09,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:09,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:05:09,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:05:09,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:05:09,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:05:09,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:05:09,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:09,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:05:09,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:05:09,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:05:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:05:09,844 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 [2025-03-17 20:05:09,847 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 135 states, 134 states have (on average 1.962686567164179) internal successors, (263), 134 states have internal predecessors, (263), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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) [2025-03-17 20:05:10,216 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 135 states, 134 states have (on average 1.962686567164179) internal successors, (263), 134 states have internal predecessors, (263), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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 541 states and 954 transitions. Complement of second has 6 states. [2025-03-17 20:05:10,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:05:10,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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) [2025-03-17 20:05:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 498 transitions. [2025-03-17 20:05:10,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 498 transitions. Stem has 1 letters. Loop has 4 letters. [2025-03-17 20:05:10,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:05:10,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 498 transitions. Stem has 5 letters. Loop has 4 letters. [2025-03-17 20:05:10,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:05:10,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 498 transitions. Stem has 1 letters. Loop has 8 letters. [2025-03-17 20:05:10,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:05:10,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 541 states and 954 transitions. [2025-03-17 20:05:10,241 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 262 [2025-03-17 20:05:10,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 541 states to 398 states and 618 transitions. [2025-03-17 20:05:10,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 264 [2025-03-17 20:05:10,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 266 [2025-03-17 20:05:10,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 398 states and 618 transitions. [2025-03-17 20:05:10,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:05:10,253 INFO L218 hiAutomatonCegarLoop]: Abstraction has 398 states and 618 transitions. [2025-03-17 20:05:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states and 618 transitions. [2025-03-17 20:05:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 396. [2025-03-17 20:05:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 396 states have (on average 1.5555555555555556) internal successors, (616), 395 states have internal predecessors, (616), 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) [2025-03-17 20:05:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 616 transitions. [2025-03-17 20:05:10,284 INFO L240 hiAutomatonCegarLoop]: Abstraction has 396 states and 616 transitions. [2025-03-17 20:05:10,284 INFO L432 stractBuchiCegarLoop]: Abstraction has 396 states and 616 transitions. [2025-03-17 20:05:10,284 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:05:10,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 396 states and 616 transitions. [2025-03-17 20:05:10,289 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 262 [2025-03-17 20:05:10,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:05:10,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:05:10,289 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:05:10,290 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:05:10,290 INFO L752 eck$LassoCheckResult]: Stem: "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(20, 2);call #Ultimate.allocInit(12, 3);~a~0 := 1;~d~0 := 4;~e~0 := 5;~f~0 := 6;~c~0 := 3;~b~0 := 2;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a17~0 := 1;~a7~0 := 0;~a20~0 := 1;~a8~0 := 15;~a12~0 := 8;~a16~0 := 5;~a21~0 := 1;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" [2025-03-17 20:05:10,290 INFO L754 eck$LassoCheckResult]: Loop: "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" "assume !((((((5 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0))) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && !(1 == ~a21~0)) && 13 == ~a8~0);" "assume !((!(1 == ~a7~0) && ((6 == ~a16~0 && 1 == ~a21~0 && 1 == ~a17~0 && 3 == calculate_output_~input#1) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0);" "assume 1 == ~a17~0 && (!(1 == ~a7~0) && (1 == ~a21~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0;~a8~0 := 13;~a7~0 := 1;~a16~0 := 4;calculate_output_#res#1 := -1;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" [2025-03-17 20:05:10,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:10,290 INFO L85 PathProgramCache]: Analyzing trace with hash 11551, now seen corresponding path program 1 times [2025-03-17 20:05:10,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:05:10,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181755007] [2025-03-17 20:05:10,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:05:10,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:05:10,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:05:10,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:05:10,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:10,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:10,303 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:05:10,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:05:10,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:05:10,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:10,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:10,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:05:10,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:10,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1750587602, now seen corresponding path program 1 times [2025-03-17 20:05:10,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:05:10,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587917933] [2025-03-17 20:05:10,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:05:10,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:05:10,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:05:10,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:05:10,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:10,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:10,329 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:05:10,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:05:10,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:05:10,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:10,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:10,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:05:10,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:10,338 INFO L85 PathProgramCache]: Analyzing trace with hash 698240500, now seen corresponding path program 1 times [2025-03-17 20:05:10,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:05:10,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390709001] [2025-03-17 20:05:10,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:05:10,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:05:10,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:05:10,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:05:10,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:10,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:10,352 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:05:10,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:05:10,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:05:10,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:10,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:10,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:05:10,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:10,518 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:05:10,518 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:05:10,518 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:05:10,518 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:05:10,518 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:05:10,518 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:10,518 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:05:10,518 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:05:10,518 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label58.c_Iteration2_Loop [2025-03-17 20:05:10,518 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:05:10,518 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:05:10,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,642 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:05:10,642 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:05:10,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:10,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:10,647 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:05:10,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-17 20:05:10,648 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:10,648 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:10,659 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:10,659 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res#1=0} Honda state: {ULTIMATE.start_calculate_output_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:10,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-17 20:05:10,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:10,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:10,666 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:05:10,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-17 20:05:10,668 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:10,668 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:10,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-17 20:05:10,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:10,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:10,695 INFO L229 MonitoredProcess]: Starting monitored process 30 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) [2025-03-17 20:05:10,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-17 20:05:10,696 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:05:10,696 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:10,723 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:05:10,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-17 20:05:10,727 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:05:10,727 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:05:10,727 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:05:10,727 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:05:10,727 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:05:10,727 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:10,727 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:05:10,727 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:05:10,727 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label58.c_Iteration2_Loop [2025-03-17 20:05:10,727 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:05:10,727 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:05:10,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:10,864 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:05:10,865 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:05:10,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:10,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:10,869 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2025-03-17 20:05:10,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-17 20:05:10,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:05:10,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:10,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:10,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:10,882 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 20:05:10,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:10,883 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-17 20:05:10,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:10,885 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:10,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-17 20:05:10,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:10,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:10,895 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2025-03-17 20:05:10,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-17 20:05:10,898 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 [2025-03-17 20:05:10,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:10,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:10,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:10,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:10,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:10,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:10,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:10,910 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:10,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:10,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:10,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:10,918 INFO L229 MonitoredProcess]: Starting monitored process 33 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) [2025-03-17 20:05:10,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-17 20:05:10,921 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 [2025-03-17 20:05:10,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:10,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:10,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:10,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:10,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:10,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:10,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:10,933 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:10,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:10,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:10,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:10,941 INFO L229 MonitoredProcess]: Starting monitored process 34 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) [2025-03-17 20:05:10,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-17 20:05:10,944 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 [2025-03-17 20:05:10,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:10,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:10,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:10,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:10,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:10,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:10,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:10,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:10,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:10,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:10,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:10,966 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2025-03-17 20:05:10,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-17 20:05:10,969 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 [2025-03-17 20:05:10,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:10,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:10,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:10,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:10,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:10,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:10,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:10,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:10,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:10,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:10,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:10,990 INFO L229 MonitoredProcess]: Starting monitored process 36 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) [2025-03-17 20:05:10,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-17 20:05:10,993 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 [2025-03-17 20:05:11,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:11,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:11,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:11,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:11,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:11,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:11,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:11,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:11,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:11,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:11,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:11,013 INFO L229 MonitoredProcess]: Starting monitored process 37 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) [2025-03-17 20:05:11,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-17 20:05:11,017 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 [2025-03-17 20:05:11,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:11,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:11,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:11,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:11,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:11,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:11,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:11,029 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:11,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-17 20:05:11,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:11,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:11,037 INFO L229 MonitoredProcess]: Starting monitored process 38 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) [2025-03-17 20:05:11,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-17 20:05:11,042 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 [2025-03-17 20:05:11,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:11,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:11,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:11,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:11,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:11,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:11,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:11,054 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:11,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:11,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:11,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:11,063 INFO L229 MonitoredProcess]: Starting monitored process 39 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) [2025-03-17 20:05:11,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-17 20:05:11,066 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 [2025-03-17 20:05:11,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:11,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:11,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:11,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:11,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:11,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:11,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:11,078 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:11,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:11,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:11,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:11,086 INFO L229 MonitoredProcess]: Starting monitored process 40 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) [2025-03-17 20:05:11,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-17 20:05:11,089 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 [2025-03-17 20:05:11,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:11,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:11,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:11,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:11,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:11,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:11,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:11,102 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:05:11,104 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:05:11,104 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 20:05:11,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:11,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:11,125 INFO L229 MonitoredProcess]: Starting monitored process 41 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) [2025-03-17 20:05:11,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-17 20:05:11,128 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:05:11,128 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:05:11,128 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:05:11,128 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a8~0) = 1*~a8~0 Supporting invariants [] [2025-03-17 20:05:11,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:11,134 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:05:11,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:11,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:05:11,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:05:11,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:11,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:05:11,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:05:11,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:05:11,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:05:11,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:05:11,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:11,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:05:11,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:05:11,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:05:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:05:11,187 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 [2025-03-17 20:05:11,187 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 396 states and 616 transitions. cyclomatic complexity: 223 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2025-03-17 20:05:11,477 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 396 states and 616 transitions. cyclomatic complexity: 223. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 1324 states and 1973 transitions. Complement of second has 6 states. [2025-03-17 20:05:11,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:05:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2025-03-17 20:05:11,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 506 transitions. [2025-03-17 20:05:11,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 506 transitions. Stem has 2 letters. Loop has 7 letters. [2025-03-17 20:05:11,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:05:11,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 506 transitions. Stem has 9 letters. Loop has 7 letters. [2025-03-17 20:05:11,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:05:11,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 506 transitions. Stem has 2 letters. Loop has 14 letters. [2025-03-17 20:05:11,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:05:11,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1324 states and 1973 transitions. [2025-03-17 20:05:11,486 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 524 [2025-03-17 20:05:11,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1324 states to 1193 states and 1654 transitions. [2025-03-17 20:05:11,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 528 [2025-03-17 20:05:11,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 531 [2025-03-17 20:05:11,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1193 states and 1654 transitions. [2025-03-17 20:05:11,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:05:11,494 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1193 states and 1654 transitions. [2025-03-17 20:05:11,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states and 1654 transitions. [2025-03-17 20:05:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1190. [2025-03-17 20:05:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1190 states have (on average 1.3873949579831932) internal successors, (1651), 1189 states have internal predecessors, (1651), 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) [2025-03-17 20:05:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1651 transitions. [2025-03-17 20:05:11,526 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1190 states and 1651 transitions. [2025-03-17 20:05:11,526 INFO L432 stractBuchiCegarLoop]: Abstraction has 1190 states and 1651 transitions. [2025-03-17 20:05:11,526 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:05:11,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1190 states and 1651 transitions. [2025-03-17 20:05:11,531 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 524 [2025-03-17 20:05:11,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:05:11,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:05:11,531 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:05:11,531 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:05:11,531 INFO L752 eck$LassoCheckResult]: Stem: "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(20, 2);call #Ultimate.allocInit(12, 3);~a~0 := 1;~d~0 := 4;~e~0 := 5;~f~0 := 6;~c~0 := 3;~b~0 := 2;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a17~0 := 1;~a7~0 := 0;~a20~0 := 1;~a8~0 := 15;~a12~0 := 8;~a16~0 := 5;~a21~0 := 1;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" [2025-03-17 20:05:11,531 INFO L754 eck$LassoCheckResult]: Loop: "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" "assume !((((((5 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0))) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && !(1 == ~a21~0)) && 13 == ~a8~0);" "assume !((!(1 == ~a7~0) && ((6 == ~a16~0 && 1 == ~a21~0 && 1 == ~a17~0 && 3 == calculate_output_~input#1) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && (!(1 == ~a7~0) && (1 == ~a21~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !((3 == calculate_output_~input#1 && (((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a7~0) && !(1 == ~a17~0)) && 15 == ~a8~0) && 1 == ~a21~0) || (((13 == ~a8~0 && 1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 4 == ~a16~0) && !(1 == ~a21~0)))) && 8 == ~a12~0);" "assume (1 == ~a17~0 && (1 == ~a21~0 && (!(1 == ~a7~0) && 4 == calculate_output_~input#1 && 15 == ~a8~0) && !(1 == ~a20~0)) && 8 == ~a12~0) && 6 == ~a16~0;~a17~0 := 0;calculate_output_#res#1 := 26;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" [2025-03-17 20:05:11,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:11,532 INFO L85 PathProgramCache]: Analyzing trace with hash 358409, now seen corresponding path program 1 times [2025-03-17 20:05:11,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:05:11,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696106792] [2025-03-17 20:05:11,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:05:11,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:05:11,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:05:11,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:05:11,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:11,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:11,538 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:05:11,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:05:11,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:05:11,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:11,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:11,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:05:11,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:11,554 INFO L85 PathProgramCache]: Analyzing trace with hash 946389143, now seen corresponding path program 1 times [2025-03-17 20:05:11,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:05:11,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893944863] [2025-03-17 20:05:11,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:05:11,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:05:11,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:05:11,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:05:11,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:11,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:11,572 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:05:11,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:05:11,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:05:11,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:11,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:11,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:05:11,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:11,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2102776207, now seen corresponding path program 1 times [2025-03-17 20:05:11,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:05:11,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703395724] [2025-03-17 20:05:11,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:05:11,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:05:11,607 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2025-03-17 20:05:11,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-17 20:05:11,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:05:11,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:05:11,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:11,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:05:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:05:11,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:05:11,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703395724] [2025-03-17 20:05:11,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703395724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:05:11,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:05:11,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:05:11,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917390473] [2025-03-17 20:05:11,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:05:11,800 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:05:11,801 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:05:11,801 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:05:11,801 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:05:11,801 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:05:11,801 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:11,801 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:05:11,801 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:05:11,801 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label58.c_Iteration3_Loop [2025-03-17 20:05:11,801 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:05:11,801 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:05:11,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:11,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:11,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:11,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:11,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:11,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:11,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:11,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:11,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:11,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:11,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:11,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:11,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:11,933 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:05:11,934 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:05:11,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:11,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:11,936 INFO L229 MonitoredProcess]: Starting monitored process 42 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) [2025-03-17 20:05:11,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-17 20:05:11,939 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:11,939 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:11,952 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:11,952 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a12~0=8} Honda state: {~a12~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:11,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:11,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:11,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:11,961 INFO L229 MonitoredProcess]: Starting monitored process 43 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) [2025-03-17 20:05:11,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-17 20:05:11,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:11,964 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:11,976 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:11,976 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a8~0=15} Honda state: {~a8~0=15} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:11,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:11,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:11,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:11,985 INFO L229 MonitoredProcess]: Starting monitored process 44 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) [2025-03-17 20:05:11,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-17 20:05:11,987 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:11,987 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:11,998 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:11,999 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input#1=0} Honda state: {ULTIMATE.start_calculate_output_#in~input#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:12,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-17 20:05:12,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:12,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:12,008 INFO L229 MonitoredProcess]: Starting monitored process 45 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) [2025-03-17 20:05:12,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-17 20:05:12,011 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:12,011 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:12,022 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:12,022 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret7#1=0} Honda state: {ULTIMATE.start_main_#t~ret7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:12,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:12,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:12,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:12,032 INFO L229 MonitoredProcess]: Starting monitored process 46 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) [2025-03-17 20:05:12,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-17 20:05:12,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:12,035 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:12,047 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:12,048 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:12,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:12,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:12,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:12,056 INFO L229 MonitoredProcess]: Starting monitored process 47 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) [2025-03-17 20:05:12,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-17 20:05:12,059 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:12,059 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:12,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-17 20:05:12,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:12,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:12,080 INFO L229 MonitoredProcess]: Starting monitored process 48 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) [2025-03-17 20:05:12,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-17 20:05:12,083 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:05:12,083 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:12,096 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:05:12,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:12,103 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:05:12,103 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:05:12,103 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:05:12,103 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:05:12,103 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:05:12,103 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:12,103 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:05:12,103 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:05:12,103 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label58.c_Iteration3_Loop [2025-03-17 20:05:12,103 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:05:12,103 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:05:12,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:12,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:12,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:12,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:12,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:12,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:12,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:12,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:12,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:12,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:12,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:12,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:12,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:12,232 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:05:12,232 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:05:12,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:12,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:12,234 INFO L229 MonitoredProcess]: Starting monitored process 49 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) [2025-03-17 20:05:12,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-17 20:05:12,237 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 [2025-03-17 20:05:12,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:12,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:12,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:12,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:12,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:12,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:12,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:12,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:12,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-17 20:05:12,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:12,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:12,257 INFO L229 MonitoredProcess]: Starting monitored process 50 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) [2025-03-17 20:05:12,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-17 20:05:12,259 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 [2025-03-17 20:05:12,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:12,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:12,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:12,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:12,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:12,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:12,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:12,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:12,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-17 20:05:12,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:12,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:12,278 INFO L229 MonitoredProcess]: Starting monitored process 51 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) [2025-03-17 20:05:12,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-17 20:05:12,280 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 [2025-03-17 20:05:12,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:12,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:12,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:12,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:12,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:12,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:12,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:12,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:12,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-17 20:05:12,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:12,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:12,303 INFO L229 MonitoredProcess]: Starting monitored process 52 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) [2025-03-17 20:05:12,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-17 20:05:12,305 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 [2025-03-17 20:05:12,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:12,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:12,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:12,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:12,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:12,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:12,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:12,316 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:12,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-17 20:05:12,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:12,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:12,324 INFO L229 MonitoredProcess]: Starting monitored process 53 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) [2025-03-17 20:05:12,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-17 20:05:12,326 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 [2025-03-17 20:05:12,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:12,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:12,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:12,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:12,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:12,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:12,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:12,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:12,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-17 20:05:12,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:12,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:12,345 INFO L229 MonitoredProcess]: Starting monitored process 54 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) [2025-03-17 20:05:12,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-17 20:05:12,347 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 [2025-03-17 20:05:12,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:12,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:12,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:12,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:12,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:12,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:12,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:12,361 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:05:12,363 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-17 20:05:12,364 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:05:12,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:12,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:12,366 INFO L229 MonitoredProcess]: Starting monitored process 55 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) [2025-03-17 20:05:12,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-17 20:05:12,368 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:05:12,368 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:05:12,368 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:05:12,368 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a17~0) = 1*~a17~0 Supporting invariants [] [2025-03-17 20:05:12,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-17 20:05:12,375 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:05:12,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:12,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:05:12,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:05:12,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:12,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:05:12,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:05:12,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:05:12,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:05:12,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:05:12,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:12,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:05:12,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:05:12,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:05:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:05:12,426 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 [2025-03-17 20:05:12,427 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1190 states and 1651 transitions. cyclomatic complexity: 470 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2025-03-17 20:05:12,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:12,756 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1190 states and 1651 transitions. cyclomatic complexity: 470. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 3983 states and 5228 transitions. Complement of second has 6 states. [2025-03-17 20:05:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:05:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2025-03-17 20:05:12,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2025-03-17 20:05:12,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 484 transitions. Stem has 3 letters. Loop has 9 letters. [2025-03-17 20:05:12,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:05:12,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 484 transitions. Stem has 12 letters. Loop has 9 letters. [2025-03-17 20:05:12,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:05:12,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 484 transitions. Stem has 3 letters. Loop has 18 letters. [2025-03-17 20:05:12,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:05:12,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3983 states and 5228 transitions. [2025-03-17 20:05:12,782 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1048 [2025-03-17 20:05:12,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3983 states to 3852 states and 4909 transitions. [2025-03-17 20:05:12,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1058 [2025-03-17 20:05:12,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1063 [2025-03-17 20:05:12,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3852 states and 4909 transitions. [2025-03-17 20:05:12,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:05:12,804 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3852 states and 4909 transitions. [2025-03-17 20:05:12,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3852 states and 4909 transitions. [2025-03-17 20:05:12,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3852 to 3845. [2025-03-17 20:05:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 3845 states have (on average 1.2749024707412224) internal successors, (4902), 3844 states have internal predecessors, (4902), 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) [2025-03-17 20:05:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 4902 transitions. [2025-03-17 20:05:12,865 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3845 states and 4902 transitions. [2025-03-17 20:05:12,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:05:12,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:05:12,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:05:12,870 INFO L87 Difference]: Start difference. First operand 3845 states and 4902 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2025-03-17 20:05:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:05:13,248 INFO L93 Difference]: Finished difference Result 7267 states and 8745 transitions. [2025-03-17 20:05:13,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7267 states and 8745 transitions. [2025-03-17 20:05:13,284 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2096 [2025-03-17 20:05:13,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7267 states to 7267 states and 8745 transitions. [2025-03-17 20:05:13,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2106 [2025-03-17 20:05:13,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2106 [2025-03-17 20:05:13,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7267 states and 8745 transitions. [2025-03-17 20:05:13,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:05:13,325 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7267 states and 8745 transitions. [2025-03-17 20:05:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7267 states and 8745 transitions. [2025-03-17 20:05:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7267 to 7267. [2025-03-17 20:05:13,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7267 states, 7267 states have (on average 1.2033851658180816) internal successors, (8745), 7266 states have internal predecessors, (8745), 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) [2025-03-17 20:05:13,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7267 states to 7267 states and 8745 transitions. [2025-03-17 20:05:13,441 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7267 states and 8745 transitions. [2025-03-17 20:05:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:05:13,442 INFO L432 stractBuchiCegarLoop]: Abstraction has 7267 states and 8745 transitions. [2025-03-17 20:05:13,442 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:05:13,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7267 states and 8745 transitions. [2025-03-17 20:05:13,466 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2096 [2025-03-17 20:05:13,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:05:13,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:05:13,467 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 20:05:13,467 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:05:13,467 INFO L752 eck$LassoCheckResult]: Stem: "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(20, 2);call #Ultimate.allocInit(12, 3);~a~0 := 1;~d~0 := 4;~e~0 := 5;~f~0 := 6;~c~0 := 3;~b~0 := 2;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a17~0 := 1;~a7~0 := 0;~a20~0 := 1;~a8~0 := 15;~a12~0 := 8;~a16~0 := 5;~a21~0 := 1;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" [2025-03-17 20:05:13,468 INFO L754 eck$LassoCheckResult]: Loop: "assume !((((((5 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0))) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && !(1 == ~a21~0)) && 13 == ~a8~0);" "assume !((!(1 == ~a7~0) && ((6 == ~a16~0 && 1 == ~a21~0 && 1 == ~a17~0 && 3 == calculate_output_~input#1) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && (!(1 == ~a7~0) && (1 == ~a21~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !((3 == calculate_output_~input#1 && (((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a7~0) && !(1 == ~a17~0)) && 15 == ~a8~0) && 1 == ~a21~0) || (((13 == ~a8~0 && 1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 4 == ~a16~0) && !(1 == ~a21~0)))) && 8 == ~a12~0);" "assume !((1 == ~a17~0 && (1 == ~a21~0 && (!(1 == ~a7~0) && 4 == calculate_output_~input#1 && 15 == ~a8~0) && !(1 == ~a20~0)) && 8 == ~a12~0) && 6 == ~a16~0);" "assume !((8 == ~a12~0 && (1 == ~a21~0 && ((5 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 5 == ~a16~0) && !(1 == ~a20~0)) && !(1 == ~a17~0));" "assume !(8 == ~a12~0 && 1 == calculate_output_~input#1 && ((1 == ~a21~0 && (15 == ~a8~0 && (!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 6 == ~a16~0) || (!(1 == ~a21~0) && 4 == ~a16~0 && 13 == ~a8~0 && (1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0)));" "assume !((((!(1 == ~a17~0) && !(1 == ~a7~0) && 1 == ~a21~0 && 15 == ~a8~0 && 4 == calculate_output_~input#1) && !(1 == ~a20~0)) && 8 == ~a12~0) && 4 == ~a16~0);" "assume !(((((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a21~0) || ((4 == ~a16~0 && (1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 13 == ~a8~0) && !(1 == ~a21~0))) && 2 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !(13 == ~a8~0 && !(1 == ~a21~0) && ((3 == calculate_output_~input#1 && (((1 == ~a20~0 && !(1 == ~a17~0)) && 6 == ~a16~0) || ((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0))) && 8 == ~a12~0) && 1 == ~a7~0);" "assume !(((1 == ~a21~0 && 8 == ~a12~0 && 1 == calculate_output_~input#1 && (((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0) || (5 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0) || (6 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0))) && !(1 == ~a7~0)) && 15 == ~a8~0);" "assume !((5 == ~a16~0 && (1 == ~a7~0 && (!(1 == ~a21~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a17~0) && 1 == ~a20~0);" "assume !(1 == ~a17~0 && (15 == ~a8~0 && (8 == ~a12~0 && (!(1 == ~a7~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a20~0)) && 5 == ~a16~0);" "assume !(!(1 == ~a7~0) && (((1 == ~a21~0 && (15 == ~a8~0 && 5 == calculate_output_~input#1) && !(1 == ~a17~0)) && 8 == ~a12~0) && 1 == ~a20~0) && 4 == ~a16~0);" "assume !((!(1 == ~a21~0) && (8 == ~a12~0 && ((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0)) && 1 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a7~0);" "assume !(1 == ~a17~0 && !(1 == ~a7~0) && (1 == ~a21~0 && (8 == ~a12~0 && 5 == calculate_output_~input#1 && (5 == ~a16~0 || 6 == ~a16~0)) && 1 == ~a20~0) && 15 == ~a8~0);" "assume !((8 == ~a12~0 && !(1 == ~a21~0) && 1 == ~a7~0 && 13 == ~a8~0 && 6 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (4 == ~a16~0 && !(1 == ~a17~0))) || (5 == ~a16~0 && !(1 == ~a17~0)))) && 1 == ~a20~0);" "assume !((5 == ~a16~0 && ((15 == ~a8~0 && (!(1 == ~a7~0) && 2 == calculate_output_~input#1) && 1 == ~a21~0) && 8 == ~a12~0) && !(1 == ~a20~0)) && !(1 == ~a17~0));" "assume !(!(1 == ~a20~0) && 1 == ~a21~0 && 4 == ~a16~0 && 15 == ~a8~0 && (8 == ~a12~0 && 2 == calculate_output_~input#1 && !(1 == ~a7~0)) && !(1 == ~a17~0));" "assume !((1 == ~a21~0 && !(1 == ~a7~0) && (!(1 == ~a20~0) && !(1 == ~a17~0) && 8 == ~a12~0 && 6 == calculate_output_~input#1) && 4 == ~a16~0) && 15 == ~a8~0);" "assume !(1 == ~a17~0 && ((((8 == ~a12~0 && 4 == calculate_output_~input#1 && 13 == ~a8~0) && 1 == ~a20~0) && !(1 == ~a21~0)) && 5 == ~a16~0) && 1 == ~a7~0);" "assume !(((13 == ~a8~0 && 8 == ~a12~0 && ((((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0)) && 1 == calculate_output_~input#1) && !(1 == ~a21~0)) && 1 == ~a20~0) && 1 == ~a7~0);" "assume !(13 == ~a8~0 && !(1 == ~a21~0) && (((((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))) && 5 == calculate_output_~input#1) && 1 == ~a7~0) && 8 == ~a12~0);" "assume !((!(1 == ~a21~0) && ((((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0)) && 4 == calculate_output_~input#1) && 1 == ~a7~0) && 8 == ~a12~0) && 13 == ~a8~0);" "assume !((1 == ~a21~0 && !(1 == ~a7~0) && ((((5 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0)) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))) && 4 == calculate_output_~input#1) && 8 == ~a12~0) && 15 == ~a8~0);" "assume !(((((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a21~0) || ((4 == ~a16~0 && ((1 == ~a7~0 && 1 == ~a17~0) && 1 == ~a20~0) && 13 == ~a8~0) && !(1 == ~a21~0))) && 4 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !(!(1 == ~a17~0) && (8 == ~a12~0 && !(1 == ~a20~0) && (15 == ~a8~0 && 1 == ~a21~0 && 4 == calculate_output_~input#1) && !(1 == ~a7~0)) && 5 == ~a16~0);" "assume !(((!(1 == ~a7~0) && (2 == calculate_output_~input#1 && (((5 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) || (4 == ~a16~0 && !(1 == ~a20~0) && 1 == ~a17~0))) && 15 == ~a8~0) && 8 == ~a12~0) && 1 == ~a21~0);" "assume !(!(1 == ~a20~0) && (((((6 == calculate_output_~input#1 && 5 == ~a16~0) && 1 == ~a21~0) && !(1 == ~a17~0)) && 8 == ~a12~0) && !(1 == ~a7~0)) && 15 == ~a8~0);" "assume !(8 == ~a12~0 && (((((1 == ~a21~0 && 5 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 6 == ~a16~0);" "assume !(((15 == ~a8~0 && !(1 == ~a7~0) && (((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 5 == ~a16~0) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) && 6 == calculate_output_~input#1) && 8 == ~a12~0) && 1 == ~a21~0);" "assume !(15 == ~a8~0 && 4 == ~a16~0 && !(1 == ~a20~0) && ((1 == ~a21~0 && !(1 == ~a17~0) && 5 == calculate_output_~input#1) && !(1 == ~a7~0)) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && 8 == ~a12~0 && 15 == ~a8~0 && ((!(1 == ~a7~0) && (5 == ~a16~0 || 6 == ~a16~0) && 2 == calculate_output_~input#1) && 1 == ~a21~0) && 1 == ~a20~0);" "assume !(!(1 == ~a7~0) && (15 == ~a8~0 && (!(1 == ~a17~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1 && 1 == ~a21~0) && 4 == ~a16~0) && 1 == ~a20~0);" "assume !(5 == ~a16~0 && (!(1 == ~a21~0) && (13 == ~a8~0 && (2 == calculate_output_~input#1 && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && 1 == ~a17~0);" "assume !(1 == ~a20~0 && (8 == ~a12~0 && 1 == ~a7~0 && 13 == ~a8~0 && ((!(1 == ~a17~0) && 5 == ~a16~0) || (1 == ~a17~0 && 6 == ~a16~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) && 3 == calculate_output_~input#1) && !(1 == ~a21~0));" "assume !(8 == ~a12~0 && 1 == ~a7~0 && !(1 == ~a21~0) && 13 == ~a8~0 && 6 == calculate_output_~input#1 && ((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))));" "assume !((!(1 == ~a7~0) && !(1 == ~a17~0) && ((4 == ~a16~0 && 15 == ~a8~0 && 1 == calculate_output_~input#1) && 8 == ~a12~0) && 1 == ~a21~0) && 1 == ~a20~0);" "assume !(1 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a20~0) && 8 == ~a12~0 && 15 == ~a8~0 && !(1 == ~a7~0) && 1 == calculate_output_~input#1) && 6 == ~a16~0);" "assume !(1 == ~a20~0 && 8 == ~a12~0 && ((1 == ~a17~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 4 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((13 == ~a8~0 && (((!(1 == ~a21~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a17~0) && 1 == ~a7~0) && 5 == ~a16~0);" "assume !(5 == ~a16~0 && (((8 == ~a12~0 && !(1 == ~a7~0) && 2 == calculate_output_~input#1 && !(1 == ~a20~0)) && 1 == ~a21~0) && 1 == ~a17~0) && 15 == ~a8~0);" "assume !((8 == ~a12~0 && ((!(1 == ~a17~0) && 1 == ~a21~0 && 4 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a20~0) && 4 == ~a16~0);" "assume !(1 == ~a7~0 && 13 == ~a8~0 && 8 == ~a12~0 && !(1 == ~a21~0) && 2 == calculate_output_~input#1 && (((1 == ~a20~0 && !(1 == ~a17~0)) && 6 == ~a16~0) || ((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0)));" "assume !(((((((!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 6 == ~a16~0) && 1 == ~a21~0) || (((13 == ~a8~0 && (1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 4 == ~a16~0) && !(1 == ~a21~0))) && 6 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !((!(1 == ~a7~0) && !(1 == ~a17~0) && (((3 == calculate_output_~input#1 && 1 == ~a21~0) && 4 == ~a16~0) && 15 == ~a8~0) && 8 == ~a12~0) && !(1 == ~a20~0));" "assume !((((8 == ~a12~0 && (((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0) || ((1 == ~a20~0 && !(1 == ~a17~0)) && 5 == ~a16~0) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0)) && 3 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((!(1 == ~a7~0) && (5 == calculate_output_~input#1 && (((5 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) || (4 == ~a16~0 && !(1 == ~a20~0) && 1 == ~a17~0))) && 8 == ~a12~0) && 1 == ~a21~0) && 15 == ~a8~0);" "assume !((!(1 == ~a7~0) && (1 == ~a21~0 && (1 == ~a17~0 && 8 == ~a12~0 && 2 == calculate_output_~input#1) && !(1 == ~a20~0)) && 6 == ~a16~0) && 15 == ~a8~0);" "assume !((!(1 == ~a17~0) && 1 == ~a21~0 && (!(1 == ~a20~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 5 == ~a16~0);" "assume !((5 == ~a16~0 && !(1 == ~a20~0) && (((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0) && 15 == ~a8~0);" "assume !(!(1 == ~a7~0) && 1 == ~a17~0 && (6 == ~a16~0 && !(1 == ~a20~0) && (6 == calculate_output_~input#1 && 8 == ~a12~0) && 1 == ~a21~0) && 15 == ~a8~0);" "assume !(((1 == ~a21~0 && 15 == ~a8~0 && 8 == ~a12~0 && !(1 == ~a7~0) && !(1 == ~a17~0) && 2 == calculate_output_~input#1) && 4 == ~a16~0) && 1 == ~a20~0);" "assume !(15 == ~a8~0 && (4 == ~a16~0 && 8 == ~a12~0 && (!(1 == ~a20~0) && !(1 == ~a7~0) && 1 == calculate_output_~input#1) && !(1 == ~a17~0)) && 1 == ~a21~0);" "assume !(1 == ~a21~0 && (8 == ~a12~0 && ((1 == ~a17~0 && 3 == calculate_output_~input#1 && (5 == ~a16~0 || 6 == ~a16~0)) && !(1 == ~a7~0)) && 1 == ~a20~0) && 15 == ~a8~0);" "assume !(!(1 == ~a21~0) && 1 == ~a20~0 && (8 == ~a12~0 && 13 == ~a8~0 && ((5 == ~a16~0 && !(1 == ~a17~0)) || (1 == ~a17~0 && 6 == ~a16~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) && 2 == calculate_output_~input#1) && 1 == ~a7~0);" "assume !(1 == ~a7~0 && 8 == ~a12~0 && ((1 == ~a20~0 && ((!(1 == ~a17~0) && 5 == ~a16~0) || (1 == ~a17~0 && 6 == ~a16~0) || (4 == ~a16~0 && !(1 == ~a17~0))) && 4 == calculate_output_~input#1) && 13 == ~a8~0) && !(1 == ~a21~0));" "assume !(1 == ~a21~0 && (((!(1 == ~a7~0) && 15 == ~a8~0 && !(1 == ~a20~0) && 4 == calculate_output_~input#1) && 1 == ~a17~0) && 5 == ~a16~0) && 8 == ~a12~0);" "assume !(((!(1 == ~a7~0) && (!(1 == ~a20~0) && 1 == ~a21~0 && 3 == calculate_output_~input#1 && 1 == ~a17~0) && 15 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0);" "assume !((((!(1 == ~a17~0) && !(1 == ~a20~0) && 15 == ~a8~0 && 1 == calculate_output_~input#1 && 5 == ~a16~0) && 8 == ~a12~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((1 == ~a21~0 && 15 == ~a8~0 && (5 == ~a16~0 && 8 == ~a12~0 && 1 == calculate_output_~input#1) && 1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0));" "assume !((!(1 == ~a21~0) && 1 == ~a20~0 && ((13 == ~a8~0 && 1 == ~a7~0 && 5 == calculate_output_~input#1) && 1 == ~a17~0) && 8 == ~a12~0) && 5 == ~a16~0);" "assume !(((!(1 == ~a7~0) && 1 == ~a21~0 && ((6 == calculate_output_~input#1 && 1 == ~a20~0) && 15 == ~a8~0) && !(1 == ~a17~0)) && 8 == ~a12~0) && 4 == ~a16~0);" "assume ((1 == ~a20~0 && ((!(1 == ~a21~0) && 1 == ~a7~0 && 1 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a17~0) && 8 == ~a12~0) && 5 == ~a16~0;~a21~0 := 1;~a16~0 := 6;~a7~0 := 0;calculate_output_#res#1 := -1;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" [2025-03-17 20:05:13,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:13,469 INFO L85 PathProgramCache]: Analyzing trace with hash 11111002, now seen corresponding path program 1 times [2025-03-17 20:05:13,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:05:13,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910672248] [2025-03-17 20:05:13,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:05:13,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:05:13,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:05:13,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:05:13,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:13,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:13,480 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:05:13,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:05:13,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:05:13,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:13,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:13,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:05:13,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:13,488 INFO L85 PathProgramCache]: Analyzing trace with hash -934938176, now seen corresponding path program 1 times [2025-03-17 20:05:13,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:05:13,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826263053] [2025-03-17 20:05:13,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:05:13,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:05:13,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 20:05:13,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 20:05:13,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:13,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:13,524 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:05:13,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 20:05:13,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 20:05:13,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:13,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:13,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:05:13,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:13,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1629841305, now seen corresponding path program 1 times [2025-03-17 20:05:13,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:05:13,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279735041] [2025-03-17 20:05:13,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:05:13,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:05:13,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 20:05:13,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 20:05:13,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:13,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:05:13,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:05:13,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:05:13,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279735041] [2025-03-17 20:05:13,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279735041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:05:13,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:05:13,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:05:13,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773113799] [2025-03-17 20:05:13,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:05:14,075 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:05:14,075 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:05:14,075 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:05:14,075 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:05:14,075 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:05:14,075 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:14,075 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:05:14,075 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:05:14,075 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label58.c_Iteration4_Loop [2025-03-17 20:05:14,075 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:05:14,075 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:05:14,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,222 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:05:14,223 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:05:14,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:14,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:14,224 INFO L229 MonitoredProcess]: Starting monitored process 56 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) [2025-03-17 20:05:14,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-17 20:05:14,226 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:14,226 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:14,237 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:14,237 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a12~0=8} Honda state: {~a12~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:14,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-17 20:05:14,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:14,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:14,245 INFO L229 MonitoredProcess]: Starting monitored process 57 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) [2025-03-17 20:05:14,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-17 20:05:14,247 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:14,247 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:14,266 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:14,266 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_~input#1=1} Honda state: {ULTIMATE.start_calculate_output_~input#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:14,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-17 20:05:14,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:14,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:14,274 INFO L229 MonitoredProcess]: Starting monitored process 58 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) [2025-03-17 20:05:14,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-17 20:05:14,275 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:14,275 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:14,286 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:05:14,286 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a8~0=13} Honda state: {~a8~0=13} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:05:14,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:14,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:14,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:14,294 INFO L229 MonitoredProcess]: Starting monitored process 59 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) [2025-03-17 20:05:14,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-17 20:05:14,295 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:05:14,295 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:14,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-17 20:05:14,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:14,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:14,313 INFO L229 MonitoredProcess]: Starting monitored process 60 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) [2025-03-17 20:05:14,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-17 20:05:14,315 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:05:14,315 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:05:14,327 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:05:14,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-03-17 20:05:14,333 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:05:14,333 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:05:14,333 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:05:14,333 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:05:14,333 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:05:14,333 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:14,333 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:05:14,333 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:05:14,333 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label58.c_Iteration4_Loop [2025-03-17 20:05:14,333 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:05:14,333 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:05:14,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:05:14,486 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:05:14,486 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:05:14,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:14,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:14,488 INFO L229 MonitoredProcess]: Starting monitored process 61 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) [2025-03-17 20:05:14,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-17 20:05:14,490 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 [2025-03-17 20:05:14,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:14,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:14,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:14,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:14,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:14,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:14,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:14,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:14,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-03-17 20:05:14,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:14,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:14,509 INFO L229 MonitoredProcess]: Starting monitored process 62 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) [2025-03-17 20:05:14,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-17 20:05:14,511 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 [2025-03-17 20:05:14,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:14,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:14,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:14,521 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2025-03-17 20:05:14,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:14,523 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-17 20:05:14,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:14,527 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:14,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-17 20:05:14,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:14,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:14,535 INFO L229 MonitoredProcess]: Starting monitored process 63 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) [2025-03-17 20:05:14,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-17 20:05:14,537 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 [2025-03-17 20:05:14,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:14,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:14,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:14,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:14,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:14,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:14,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:14,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:14,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-17 20:05:14,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:14,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:14,555 INFO L229 MonitoredProcess]: Starting monitored process 64 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) [2025-03-17 20:05:14,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-17 20:05:14,557 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 [2025-03-17 20:05:14,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:14,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:14,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:14,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:14,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:14,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:14,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:14,569 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:05:14,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-17 20:05:14,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:14,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:14,576 INFO L229 MonitoredProcess]: Starting monitored process 65 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) [2025-03-17 20:05:14,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-17 20:05:14,578 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 [2025-03-17 20:05:14,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:05:14,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:05:14,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:05:14,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:05:14,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:05:14,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:05:14,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:05:14,590 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:05:14,592 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-17 20:05:14,592 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:05:14,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:05:14,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:05:14,594 INFO L229 MonitoredProcess]: Starting monitored process 66 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) [2025-03-17 20:05:14,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-17 20:05:14,595 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:05:14,595 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:05:14,595 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:05:14,595 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a7~0) = 1*~a7~0 Supporting invariants [] [2025-03-17 20:05:14,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-17 20:05:14,601 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:05:14,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:14,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:05:14,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:05:14,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:14,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:05:14,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:05:14,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:05:14,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 20:05:14,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 20:05:14,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:14,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:05:14,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:05:14,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:05:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:05:14,757 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 [2025-03-17 20:05:14,758 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7267 states and 8745 transitions. cyclomatic complexity: 1515 Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-03-17 20:05:15,108 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7267 states and 8745 transitions. cyclomatic complexity: 1515. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 24256 states and 28317 transitions. Complement of second has 5 states. [2025-03-17 20:05:15,108 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 [2025-03-17 20:05:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-03-17 20:05:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-03-17 20:05:15,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 180 transitions. Stem has 4 letters. Loop has 68 letters. [2025-03-17 20:05:15,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:05:15,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 180 transitions. Stem has 72 letters. Loop has 68 letters. [2025-03-17 20:05:15,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:05:15,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 180 transitions. Stem has 4 letters. Loop has 136 letters. [2025-03-17 20:05:15,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:05:15,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24256 states and 28317 transitions. [2025-03-17 20:05:15,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-17 20:05:15,225 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 4192 [2025-03-17 20:05:15,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24256 states to 24256 states and 28317 transitions. [2025-03-17 20:05:15,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4230 [2025-03-17 20:05:15,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4242 [2025-03-17 20:05:15,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24256 states and 28317 transitions. [2025-03-17 20:05:15,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:05:15,310 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24256 states and 28317 transitions. [2025-03-17 20:05:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24256 states and 28317 transitions. [2025-03-17 20:05:15,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24256 to 24233. [2025-03-17 20:05:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24233 states, 24233 states have (on average 1.167581397268188) internal successors, (28294), 24232 states have internal predecessors, (28294), 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) [2025-03-17 20:05:15,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24233 states to 24233 states and 28294 transitions. [2025-03-17 20:05:15,608 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24233 states and 28294 transitions. [2025-03-17 20:05:15,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:05:15,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:05:15,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:05:15,609 INFO L87 Difference]: Start difference. First operand 24233 states and 28294 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 2 states have internal predecessors, (72), 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) [2025-03-17 20:05:16,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:05:16,097 INFO L93 Difference]: Finished difference Result 48031 states and 54852 transitions. [2025-03-17 20:05:16,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48031 states and 54852 transitions. [2025-03-17 20:05:16,225 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 8384 [2025-03-17 20:05:16,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48031 states to 45130 states and 51546 transitions. [2025-03-17 20:05:16,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8440 [2025-03-17 20:05:16,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8440 [2025-03-17 20:05:16,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45130 states and 51546 transitions. [2025-03-17 20:05:16,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:05:16,357 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45130 states and 51546 transitions. [2025-03-17 20:05:16,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45130 states and 51546 transitions. [2025-03-17 20:05:16,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45130 to 41165. [2025-03-17 20:05:16,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41165 states, 41165 states have (on average 1.1480626746022107) internal successors, (47260), 41164 states have internal predecessors, (47260), 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) [2025-03-17 20:05:17,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41165 states to 41165 states and 47260 transitions. [2025-03-17 20:05:17,054 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41165 states and 47260 transitions. [2025-03-17 20:05:17,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:05:17,056 INFO L432 stractBuchiCegarLoop]: Abstraction has 41165 states and 47260 transitions. [2025-03-17 20:05:17,056 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:05:17,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41165 states and 47260 transitions. [2025-03-17 20:05:17,140 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 7336 [2025-03-17 20:05:17,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:05:17,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:05:17,143 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 20:05:17,143 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:05:17,143 INFO L752 eck$LassoCheckResult]: Stem: "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(20, 2);call #Ultimate.allocInit(12, 3);~a~0 := 1;~d~0 := 4;~e~0 := 5;~f~0 := 6;~c~0 := 3;~b~0 := 2;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a17~0 := 1;~a7~0 := 0;~a20~0 := 1;~a8~0 := 15;~a12~0 := 8;~a16~0 := 5;~a21~0 := 1;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" [2025-03-17 20:05:17,143 INFO L754 eck$LassoCheckResult]: Loop: "assume !((((((5 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0))) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && !(1 == ~a21~0)) && 13 == ~a8~0);" "assume !((!(1 == ~a7~0) && ((6 == ~a16~0 && 1 == ~a21~0 && 1 == ~a17~0 && 3 == calculate_output_~input#1) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && (!(1 == ~a7~0) && (1 == ~a21~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !((3 == calculate_output_~input#1 && (((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a7~0) && !(1 == ~a17~0)) && 15 == ~a8~0) && 1 == ~a21~0) || (((13 == ~a8~0 && 1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 4 == ~a16~0) && !(1 == ~a21~0)))) && 8 == ~a12~0);" "assume !((1 == ~a17~0 && (1 == ~a21~0 && (!(1 == ~a7~0) && 4 == calculate_output_~input#1 && 15 == ~a8~0) && !(1 == ~a20~0)) && 8 == ~a12~0) && 6 == ~a16~0);" "assume !((8 == ~a12~0 && (1 == ~a21~0 && ((5 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 5 == ~a16~0) && !(1 == ~a20~0)) && !(1 == ~a17~0));" "assume !(8 == ~a12~0 && 1 == calculate_output_~input#1 && ((1 == ~a21~0 && (15 == ~a8~0 && (!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 6 == ~a16~0) || (!(1 == ~a21~0) && 4 == ~a16~0 && 13 == ~a8~0 && (1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0)));" "assume !((((!(1 == ~a17~0) && !(1 == ~a7~0) && 1 == ~a21~0 && 15 == ~a8~0 && 4 == calculate_output_~input#1) && !(1 == ~a20~0)) && 8 == ~a12~0) && 4 == ~a16~0);" "assume !(((((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a21~0) || ((4 == ~a16~0 && (1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 13 == ~a8~0) && !(1 == ~a21~0))) && 2 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !(13 == ~a8~0 && !(1 == ~a21~0) && ((3 == calculate_output_~input#1 && (((1 == ~a20~0 && !(1 == ~a17~0)) && 6 == ~a16~0) || ((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0))) && 8 == ~a12~0) && 1 == ~a7~0);" "assume !(((1 == ~a21~0 && 8 == ~a12~0 && 1 == calculate_output_~input#1 && (((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0) || (5 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0) || (6 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0))) && !(1 == ~a7~0)) && 15 == ~a8~0);" "assume !((5 == ~a16~0 && (1 == ~a7~0 && (!(1 == ~a21~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a17~0) && 1 == ~a20~0);" "assume !(1 == ~a17~0 && (15 == ~a8~0 && (8 == ~a12~0 && (!(1 == ~a7~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a20~0)) && 5 == ~a16~0);" "assume !(!(1 == ~a7~0) && (((1 == ~a21~0 && (15 == ~a8~0 && 5 == calculate_output_~input#1) && !(1 == ~a17~0)) && 8 == ~a12~0) && 1 == ~a20~0) && 4 == ~a16~0);" "assume !((!(1 == ~a21~0) && (8 == ~a12~0 && ((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0)) && 1 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a7~0);" "assume !(1 == ~a17~0 && !(1 == ~a7~0) && (1 == ~a21~0 && (8 == ~a12~0 && 5 == calculate_output_~input#1 && (5 == ~a16~0 || 6 == ~a16~0)) && 1 == ~a20~0) && 15 == ~a8~0);" "assume !((8 == ~a12~0 && !(1 == ~a21~0) && 1 == ~a7~0 && 13 == ~a8~0 && 6 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (4 == ~a16~0 && !(1 == ~a17~0))) || (5 == ~a16~0 && !(1 == ~a17~0)))) && 1 == ~a20~0);" "assume !((5 == ~a16~0 && ((15 == ~a8~0 && (!(1 == ~a7~0) && 2 == calculate_output_~input#1) && 1 == ~a21~0) && 8 == ~a12~0) && !(1 == ~a20~0)) && !(1 == ~a17~0));" "assume !(!(1 == ~a20~0) && 1 == ~a21~0 && 4 == ~a16~0 && 15 == ~a8~0 && (8 == ~a12~0 && 2 == calculate_output_~input#1 && !(1 == ~a7~0)) && !(1 == ~a17~0));" "assume !((1 == ~a21~0 && !(1 == ~a7~0) && (!(1 == ~a20~0) && !(1 == ~a17~0) && 8 == ~a12~0 && 6 == calculate_output_~input#1) && 4 == ~a16~0) && 15 == ~a8~0);" "assume !(1 == ~a17~0 && ((((8 == ~a12~0 && 4 == calculate_output_~input#1 && 13 == ~a8~0) && 1 == ~a20~0) && !(1 == ~a21~0)) && 5 == ~a16~0) && 1 == ~a7~0);" "assume !(((13 == ~a8~0 && 8 == ~a12~0 && ((((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0)) && 1 == calculate_output_~input#1) && !(1 == ~a21~0)) && 1 == ~a20~0) && 1 == ~a7~0);" "assume !(13 == ~a8~0 && !(1 == ~a21~0) && (((((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))) && 5 == calculate_output_~input#1) && 1 == ~a7~0) && 8 == ~a12~0);" "assume !((!(1 == ~a21~0) && ((((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0)) && 4 == calculate_output_~input#1) && 1 == ~a7~0) && 8 == ~a12~0) && 13 == ~a8~0);" "assume !((1 == ~a21~0 && !(1 == ~a7~0) && ((((5 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0)) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))) && 4 == calculate_output_~input#1) && 8 == ~a12~0) && 15 == ~a8~0);" "assume !(((((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a21~0) || ((4 == ~a16~0 && ((1 == ~a7~0 && 1 == ~a17~0) && 1 == ~a20~0) && 13 == ~a8~0) && !(1 == ~a21~0))) && 4 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !(!(1 == ~a17~0) && (8 == ~a12~0 && !(1 == ~a20~0) && (15 == ~a8~0 && 1 == ~a21~0 && 4 == calculate_output_~input#1) && !(1 == ~a7~0)) && 5 == ~a16~0);" "assume !(((!(1 == ~a7~0) && (2 == calculate_output_~input#1 && (((5 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) || (4 == ~a16~0 && !(1 == ~a20~0) && 1 == ~a17~0))) && 15 == ~a8~0) && 8 == ~a12~0) && 1 == ~a21~0);" "assume !(!(1 == ~a20~0) && (((((6 == calculate_output_~input#1 && 5 == ~a16~0) && 1 == ~a21~0) && !(1 == ~a17~0)) && 8 == ~a12~0) && !(1 == ~a7~0)) && 15 == ~a8~0);" "assume !(8 == ~a12~0 && (((((1 == ~a21~0 && 5 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 6 == ~a16~0);" "assume !(((15 == ~a8~0 && !(1 == ~a7~0) && (((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 5 == ~a16~0) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) && 6 == calculate_output_~input#1) && 8 == ~a12~0) && 1 == ~a21~0);" "assume !(15 == ~a8~0 && 4 == ~a16~0 && !(1 == ~a20~0) && ((1 == ~a21~0 && !(1 == ~a17~0) && 5 == calculate_output_~input#1) && !(1 == ~a7~0)) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && 8 == ~a12~0 && 15 == ~a8~0 && ((!(1 == ~a7~0) && (5 == ~a16~0 || 6 == ~a16~0) && 2 == calculate_output_~input#1) && 1 == ~a21~0) && 1 == ~a20~0);" "assume !(!(1 == ~a7~0) && (15 == ~a8~0 && (!(1 == ~a17~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1 && 1 == ~a21~0) && 4 == ~a16~0) && 1 == ~a20~0);" "assume !(5 == ~a16~0 && (!(1 == ~a21~0) && (13 == ~a8~0 && (2 == calculate_output_~input#1 && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && 1 == ~a17~0);" "assume !(1 == ~a20~0 && (8 == ~a12~0 && 1 == ~a7~0 && 13 == ~a8~0 && ((!(1 == ~a17~0) && 5 == ~a16~0) || (1 == ~a17~0 && 6 == ~a16~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) && 3 == calculate_output_~input#1) && !(1 == ~a21~0));" "assume !(8 == ~a12~0 && 1 == ~a7~0 && !(1 == ~a21~0) && 13 == ~a8~0 && 6 == calculate_output_~input#1 && ((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))));" "assume !((!(1 == ~a7~0) && !(1 == ~a17~0) && ((4 == ~a16~0 && 15 == ~a8~0 && 1 == calculate_output_~input#1) && 8 == ~a12~0) && 1 == ~a21~0) && 1 == ~a20~0);" "assume !(1 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a20~0) && 8 == ~a12~0 && 15 == ~a8~0 && !(1 == ~a7~0) && 1 == calculate_output_~input#1) && 6 == ~a16~0);" "assume !(1 == ~a20~0 && 8 == ~a12~0 && ((1 == ~a17~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 4 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((13 == ~a8~0 && (((!(1 == ~a21~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a17~0) && 1 == ~a7~0) && 5 == ~a16~0);" "assume !(5 == ~a16~0 && (((8 == ~a12~0 && !(1 == ~a7~0) && 2 == calculate_output_~input#1 && !(1 == ~a20~0)) && 1 == ~a21~0) && 1 == ~a17~0) && 15 == ~a8~0);" "assume !((8 == ~a12~0 && ((!(1 == ~a17~0) && 1 == ~a21~0 && 4 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a20~0) && 4 == ~a16~0);" "assume !(1 == ~a7~0 && 13 == ~a8~0 && 8 == ~a12~0 && !(1 == ~a21~0) && 2 == calculate_output_~input#1 && (((1 == ~a20~0 && !(1 == ~a17~0)) && 6 == ~a16~0) || ((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0)));" "assume !(((((((!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 6 == ~a16~0) && 1 == ~a21~0) || (((13 == ~a8~0 && (1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 4 == ~a16~0) && !(1 == ~a21~0))) && 6 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !((!(1 == ~a7~0) && !(1 == ~a17~0) && (((3 == calculate_output_~input#1 && 1 == ~a21~0) && 4 == ~a16~0) && 15 == ~a8~0) && 8 == ~a12~0) && !(1 == ~a20~0));" "assume !((((8 == ~a12~0 && (((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0) || ((1 == ~a20~0 && !(1 == ~a17~0)) && 5 == ~a16~0) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0)) && 3 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((!(1 == ~a7~0) && (5 == calculate_output_~input#1 && (((5 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) || (4 == ~a16~0 && !(1 == ~a20~0) && 1 == ~a17~0))) && 8 == ~a12~0) && 1 == ~a21~0) && 15 == ~a8~0);" "assume !((!(1 == ~a7~0) && (1 == ~a21~0 && (1 == ~a17~0 && 8 == ~a12~0 && 2 == calculate_output_~input#1) && !(1 == ~a20~0)) && 6 == ~a16~0) && 15 == ~a8~0);" "assume !((!(1 == ~a17~0) && 1 == ~a21~0 && (!(1 == ~a20~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 5 == ~a16~0);" "assume !((5 == ~a16~0 && !(1 == ~a20~0) && (((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0) && 15 == ~a8~0);" "assume !(!(1 == ~a7~0) && 1 == ~a17~0 && (6 == ~a16~0 && !(1 == ~a20~0) && (6 == calculate_output_~input#1 && 8 == ~a12~0) && 1 == ~a21~0) && 15 == ~a8~0);" "assume !(((1 == ~a21~0 && 15 == ~a8~0 && 8 == ~a12~0 && !(1 == ~a7~0) && !(1 == ~a17~0) && 2 == calculate_output_~input#1) && 4 == ~a16~0) && 1 == ~a20~0);" "assume !(15 == ~a8~0 && (4 == ~a16~0 && 8 == ~a12~0 && (!(1 == ~a20~0) && !(1 == ~a7~0) && 1 == calculate_output_~input#1) && !(1 == ~a17~0)) && 1 == ~a21~0);" "assume !(1 == ~a21~0 && (8 == ~a12~0 && ((1 == ~a17~0 && 3 == calculate_output_~input#1 && (5 == ~a16~0 || 6 == ~a16~0)) && !(1 == ~a7~0)) && 1 == ~a20~0) && 15 == ~a8~0);" "assume !(!(1 == ~a21~0) && 1 == ~a20~0 && (8 == ~a12~0 && 13 == ~a8~0 && ((5 == ~a16~0 && !(1 == ~a17~0)) || (1 == ~a17~0 && 6 == ~a16~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) && 2 == calculate_output_~input#1) && 1 == ~a7~0);" "assume !(1 == ~a7~0 && 8 == ~a12~0 && ((1 == ~a20~0 && ((!(1 == ~a17~0) && 5 == ~a16~0) || (1 == ~a17~0 && 6 == ~a16~0) || (4 == ~a16~0 && !(1 == ~a17~0))) && 4 == calculate_output_~input#1) && 13 == ~a8~0) && !(1 == ~a21~0));" "assume !(1 == ~a21~0 && (((!(1 == ~a7~0) && 15 == ~a8~0 && !(1 == ~a20~0) && 4 == calculate_output_~input#1) && 1 == ~a17~0) && 5 == ~a16~0) && 8 == ~a12~0);" "assume !(((!(1 == ~a7~0) && (!(1 == ~a20~0) && 1 == ~a21~0 && 3 == calculate_output_~input#1 && 1 == ~a17~0) && 15 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0);" "assume !((((!(1 == ~a17~0) && !(1 == ~a20~0) && 15 == ~a8~0 && 1 == calculate_output_~input#1 && 5 == ~a16~0) && 8 == ~a12~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((1 == ~a21~0 && 15 == ~a8~0 && (5 == ~a16~0 && 8 == ~a12~0 && 1 == calculate_output_~input#1) && 1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0));" "assume !((!(1 == ~a21~0) && 1 == ~a20~0 && ((13 == ~a8~0 && 1 == ~a7~0 && 5 == calculate_output_~input#1) && 1 == ~a17~0) && 8 == ~a12~0) && 5 == ~a16~0);" "assume !(((!(1 == ~a7~0) && 1 == ~a21~0 && ((6 == calculate_output_~input#1 && 1 == ~a20~0) && 15 == ~a8~0) && !(1 == ~a17~0)) && 8 == ~a12~0) && 4 == ~a16~0);" "assume !(((1 == ~a20~0 && ((!(1 == ~a21~0) && 1 == ~a7~0 && 1 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a17~0) && 8 == ~a12~0) && 5 == ~a16~0);" "assume !(8 == ~a12~0 && 5 == calculate_output_~input#1 && ((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 15 == ~a8~0) && 6 == ~a16~0) && 1 == ~a21~0) || (!(1 == ~a21~0) && 4 == ~a16~0 && (1 == ~a20~0 && 1 == ~a7~0 && 1 == ~a17~0) && 13 == ~a8~0)));" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "calculate_output_#res#1 := -2;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" [2025-03-17 20:05:17,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:17,145 INFO L85 PathProgramCache]: Analyzing trace with hash 11111002, now seen corresponding path program 2 times [2025-03-17 20:05:17,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:05:17,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625849967] [2025-03-17 20:05:17,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:05:17,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:05:17,150 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:05:17,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:05:17,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:05:17,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:17,153 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:05:17,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:05:17,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:05:17,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:17,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:17,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:05:17,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:17,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1817668742, now seen corresponding path program 1 times [2025-03-17 20:05:17,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:05:17,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072731527] [2025-03-17 20:05:17,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:05:17,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:05:17,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 20:05:17,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 20:05:17,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:17,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:17,198 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:05:17,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 20:05:17,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 20:05:17,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:17,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:17,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:05:17,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:17,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1569020019, now seen corresponding path program 1 times [2025-03-17 20:05:17,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:05:17,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144568941] [2025-03-17 20:05:17,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:05:17,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:05:17,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 20:05:17,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 20:05:17,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:17,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:05:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:05:18,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:05:18,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144568941] [2025-03-17 20:05:18,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144568941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:05:18,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:05:18,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 20:05:18,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384530274] [2025-03-17 20:05:18,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:05:22,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:05:22,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 20:05:22,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-17 20:05:22,339 INFO L87 Difference]: Start difference. First operand 41165 states and 47260 transitions. cyclomatic complexity: 6257 Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 9 states have internal predecessors, (135), 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) [2025-03-17 20:05:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:05:23,172 INFO L93 Difference]: Finished difference Result 42261 states and 48368 transitions. [2025-03-17 20:05:23,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42261 states and 48368 transitions. [2025-03-17 20:05:23,278 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 7336 [2025-03-17 20:05:23,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42261 states to 41569 states and 47676 transitions. [2025-03-17 20:05:23,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7383 [2025-03-17 20:05:23,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7383 [2025-03-17 20:05:23,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41569 states and 47676 transitions. [2025-03-17 20:05:23,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:05:23,432 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41569 states and 47676 transitions. [2025-03-17 20:05:23,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41569 states and 47676 transitions. [2025-03-17 20:05:23,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41569 to 41569. [2025-03-17 20:05:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41569 states, 41569 states have (on average 1.1469123625778825) internal successors, (47676), 41568 states have internal predecessors, (47676), 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) [2025-03-17 20:05:23,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41569 states to 41569 states and 47676 transitions. [2025-03-17 20:05:23,768 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41569 states and 47676 transitions. [2025-03-17 20:05:23,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 20:05:23,769 INFO L432 stractBuchiCegarLoop]: Abstraction has 41569 states and 47676 transitions. [2025-03-17 20:05:23,769 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 20:05:23,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41569 states and 47676 transitions. [2025-03-17 20:05:23,929 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 7336 [2025-03-17 20:05:23,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:05:23,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:05:23,930 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:05:23,930 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:05:23,930 INFO L752 eck$LassoCheckResult]: Stem: "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(20, 2);call #Ultimate.allocInit(12, 3);~a~0 := 1;~d~0 := 4;~e~0 := 5;~f~0 := 6;~c~0 := 3;~b~0 := 2;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a17~0 := 1;~a7~0 := 0;~a20~0 := 1;~a8~0 := 15;~a12~0 := 8;~a16~0 := 5;~a21~0 := 1;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume (15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0;~a16~0 := 5;~a20~0 := 0;calculate_output_#res#1 := 24;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" [2025-03-17 20:05:23,930 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" "assume !((((((5 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0))) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && !(1 == ~a21~0)) && 13 == ~a8~0);" "assume !((!(1 == ~a7~0) && ((6 == ~a16~0 && 1 == ~a21~0 && 1 == ~a17~0 && 3 == calculate_output_~input#1) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && (!(1 == ~a7~0) && (1 == ~a21~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !((3 == calculate_output_~input#1 && (((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a7~0) && !(1 == ~a17~0)) && 15 == ~a8~0) && 1 == ~a21~0) || (((13 == ~a8~0 && 1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 4 == ~a16~0) && !(1 == ~a21~0)))) && 8 == ~a12~0);" "assume !((1 == ~a17~0 && (1 == ~a21~0 && (!(1 == ~a7~0) && 4 == calculate_output_~input#1 && 15 == ~a8~0) && !(1 == ~a20~0)) && 8 == ~a12~0) && 6 == ~a16~0);" "assume !((8 == ~a12~0 && (1 == ~a21~0 && ((5 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 5 == ~a16~0) && !(1 == ~a20~0)) && !(1 == ~a17~0));" "assume !(8 == ~a12~0 && 1 == calculate_output_~input#1 && ((1 == ~a21~0 && (15 == ~a8~0 && (!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 6 == ~a16~0) || (!(1 == ~a21~0) && 4 == ~a16~0 && 13 == ~a8~0 && (1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0)));" "assume !((((!(1 == ~a17~0) && !(1 == ~a7~0) && 1 == ~a21~0 && 15 == ~a8~0 && 4 == calculate_output_~input#1) && !(1 == ~a20~0)) && 8 == ~a12~0) && 4 == ~a16~0);" "assume !(((((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a21~0) || ((4 == ~a16~0 && (1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 13 == ~a8~0) && !(1 == ~a21~0))) && 2 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !(13 == ~a8~0 && !(1 == ~a21~0) && ((3 == calculate_output_~input#1 && (((1 == ~a20~0 && !(1 == ~a17~0)) && 6 == ~a16~0) || ((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0))) && 8 == ~a12~0) && 1 == ~a7~0);" "assume !(((1 == ~a21~0 && 8 == ~a12~0 && 1 == calculate_output_~input#1 && (((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0) || (5 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0) || (6 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0))) && !(1 == ~a7~0)) && 15 == ~a8~0);" "assume !((5 == ~a16~0 && (1 == ~a7~0 && (!(1 == ~a21~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a17~0) && 1 == ~a20~0);" "assume !(1 == ~a17~0 && (15 == ~a8~0 && (8 == ~a12~0 && (!(1 == ~a7~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a20~0)) && 5 == ~a16~0);" "assume !(!(1 == ~a7~0) && (((1 == ~a21~0 && (15 == ~a8~0 && 5 == calculate_output_~input#1) && !(1 == ~a17~0)) && 8 == ~a12~0) && 1 == ~a20~0) && 4 == ~a16~0);" "assume !((!(1 == ~a21~0) && (8 == ~a12~0 && ((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0)) && 1 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a7~0);" "assume !(1 == ~a17~0 && !(1 == ~a7~0) && (1 == ~a21~0 && (8 == ~a12~0 && 5 == calculate_output_~input#1 && (5 == ~a16~0 || 6 == ~a16~0)) && 1 == ~a20~0) && 15 == ~a8~0);" "assume !((8 == ~a12~0 && !(1 == ~a21~0) && 1 == ~a7~0 && 13 == ~a8~0 && 6 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (4 == ~a16~0 && !(1 == ~a17~0))) || (5 == ~a16~0 && !(1 == ~a17~0)))) && 1 == ~a20~0);" "assume !((5 == ~a16~0 && ((15 == ~a8~0 && (!(1 == ~a7~0) && 2 == calculate_output_~input#1) && 1 == ~a21~0) && 8 == ~a12~0) && !(1 == ~a20~0)) && !(1 == ~a17~0));" "assume !(!(1 == ~a20~0) && 1 == ~a21~0 && 4 == ~a16~0 && 15 == ~a8~0 && (8 == ~a12~0 && 2 == calculate_output_~input#1 && !(1 == ~a7~0)) && !(1 == ~a17~0));" "assume !((1 == ~a21~0 && !(1 == ~a7~0) && (!(1 == ~a20~0) && !(1 == ~a17~0) && 8 == ~a12~0 && 6 == calculate_output_~input#1) && 4 == ~a16~0) && 15 == ~a8~0);" "assume !(1 == ~a17~0 && ((((8 == ~a12~0 && 4 == calculate_output_~input#1 && 13 == ~a8~0) && 1 == ~a20~0) && !(1 == ~a21~0)) && 5 == ~a16~0) && 1 == ~a7~0);" "assume !(((13 == ~a8~0 && 8 == ~a12~0 && ((((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0)) && 1 == calculate_output_~input#1) && !(1 == ~a21~0)) && 1 == ~a20~0) && 1 == ~a7~0);" "assume !(13 == ~a8~0 && !(1 == ~a21~0) && (((((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))) && 5 == calculate_output_~input#1) && 1 == ~a7~0) && 8 == ~a12~0);" "assume !((!(1 == ~a21~0) && ((((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0)) && 4 == calculate_output_~input#1) && 1 == ~a7~0) && 8 == ~a12~0) && 13 == ~a8~0);" "assume !((1 == ~a21~0 && !(1 == ~a7~0) && ((((5 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0)) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))) && 4 == calculate_output_~input#1) && 8 == ~a12~0) && 15 == ~a8~0);" "assume !(((((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a21~0) || ((4 == ~a16~0 && ((1 == ~a7~0 && 1 == ~a17~0) && 1 == ~a20~0) && 13 == ~a8~0) && !(1 == ~a21~0))) && 4 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !(!(1 == ~a17~0) && (8 == ~a12~0 && !(1 == ~a20~0) && (15 == ~a8~0 && 1 == ~a21~0 && 4 == calculate_output_~input#1) && !(1 == ~a7~0)) && 5 == ~a16~0);" "assume !(((!(1 == ~a7~0) && (2 == calculate_output_~input#1 && (((5 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) || (4 == ~a16~0 && !(1 == ~a20~0) && 1 == ~a17~0))) && 15 == ~a8~0) && 8 == ~a12~0) && 1 == ~a21~0);" "assume !(!(1 == ~a20~0) && (((((6 == calculate_output_~input#1 && 5 == ~a16~0) && 1 == ~a21~0) && !(1 == ~a17~0)) && 8 == ~a12~0) && !(1 == ~a7~0)) && 15 == ~a8~0);" "assume !(8 == ~a12~0 && (((((1 == ~a21~0 && 5 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 6 == ~a16~0);" "assume !(((15 == ~a8~0 && !(1 == ~a7~0) && (((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 5 == ~a16~0) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) && 6 == calculate_output_~input#1) && 8 == ~a12~0) && 1 == ~a21~0);" "assume !(15 == ~a8~0 && 4 == ~a16~0 && !(1 == ~a20~0) && ((1 == ~a21~0 && !(1 == ~a17~0) && 5 == calculate_output_~input#1) && !(1 == ~a7~0)) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && 8 == ~a12~0 && 15 == ~a8~0 && ((!(1 == ~a7~0) && (5 == ~a16~0 || 6 == ~a16~0) && 2 == calculate_output_~input#1) && 1 == ~a21~0) && 1 == ~a20~0);" "assume !(!(1 == ~a7~0) && (15 == ~a8~0 && (!(1 == ~a17~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1 && 1 == ~a21~0) && 4 == ~a16~0) && 1 == ~a20~0);" "assume !(5 == ~a16~0 && (!(1 == ~a21~0) && (13 == ~a8~0 && (2 == calculate_output_~input#1 && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && 1 == ~a17~0);" "assume !(1 == ~a20~0 && (8 == ~a12~0 && 1 == ~a7~0 && 13 == ~a8~0 && ((!(1 == ~a17~0) && 5 == ~a16~0) || (1 == ~a17~0 && 6 == ~a16~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) && 3 == calculate_output_~input#1) && !(1 == ~a21~0));" "assume !(8 == ~a12~0 && 1 == ~a7~0 && !(1 == ~a21~0) && 13 == ~a8~0 && 6 == calculate_output_~input#1 && ((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))));" "assume !((!(1 == ~a7~0) && !(1 == ~a17~0) && ((4 == ~a16~0 && 15 == ~a8~0 && 1 == calculate_output_~input#1) && 8 == ~a12~0) && 1 == ~a21~0) && 1 == ~a20~0);" "assume !(1 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a20~0) && 8 == ~a12~0 && 15 == ~a8~0 && !(1 == ~a7~0) && 1 == calculate_output_~input#1) && 6 == ~a16~0);" "assume !(1 == ~a20~0 && 8 == ~a12~0 && ((1 == ~a17~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 4 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((13 == ~a8~0 && (((!(1 == ~a21~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a17~0) && 1 == ~a7~0) && 5 == ~a16~0);" "assume !(5 == ~a16~0 && (((8 == ~a12~0 && !(1 == ~a7~0) && 2 == calculate_output_~input#1 && !(1 == ~a20~0)) && 1 == ~a21~0) && 1 == ~a17~0) && 15 == ~a8~0);" "assume !((8 == ~a12~0 && ((!(1 == ~a17~0) && 1 == ~a21~0 && 4 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a20~0) && 4 == ~a16~0);" "assume !(1 == ~a7~0 && 13 == ~a8~0 && 8 == ~a12~0 && !(1 == ~a21~0) && 2 == calculate_output_~input#1 && (((1 == ~a20~0 && !(1 == ~a17~0)) && 6 == ~a16~0) || ((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0)));" "assume !(((((((!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 6 == ~a16~0) && 1 == ~a21~0) || (((13 == ~a8~0 && (1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 4 == ~a16~0) && !(1 == ~a21~0))) && 6 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !((!(1 == ~a7~0) && !(1 == ~a17~0) && (((3 == calculate_output_~input#1 && 1 == ~a21~0) && 4 == ~a16~0) && 15 == ~a8~0) && 8 == ~a12~0) && !(1 == ~a20~0));" "assume !((((8 == ~a12~0 && (((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0) || ((1 == ~a20~0 && !(1 == ~a17~0)) && 5 == ~a16~0) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0)) && 3 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((!(1 == ~a7~0) && (5 == calculate_output_~input#1 && (((5 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) || (4 == ~a16~0 && !(1 == ~a20~0) && 1 == ~a17~0))) && 8 == ~a12~0) && 1 == ~a21~0) && 15 == ~a8~0);" "assume !((!(1 == ~a7~0) && (1 == ~a21~0 && (1 == ~a17~0 && 8 == ~a12~0 && 2 == calculate_output_~input#1) && !(1 == ~a20~0)) && 6 == ~a16~0) && 15 == ~a8~0);" "assume !((!(1 == ~a17~0) && 1 == ~a21~0 && (!(1 == ~a20~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 5 == ~a16~0);" "assume (5 == ~a16~0 && !(1 == ~a20~0) && (((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0) && 15 == ~a8~0;calculate_output_#res#1 := 24;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" [2025-03-17 20:05:23,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:23,931 INFO L85 PathProgramCache]: Analyzing trace with hash 344434987, now seen corresponding path program 2 times [2025-03-17 20:05:23,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:05:23,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808254027] [2025-03-17 20:05:23,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:05:23,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:05:23,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:05:23,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:05:23,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:05:23,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:23,936 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:05:23,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:05:23,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:05:23,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:23,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:23,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:05:23,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:23,946 INFO L85 PathProgramCache]: Analyzing trace with hash -750403322, now seen corresponding path program 1 times [2025-03-17 20:05:23,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:05:23,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324428632] [2025-03-17 20:05:23,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:05:23,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:05:23,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 20:05:23,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 20:05:23,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:23,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:23,964 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:05:23,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 20:05:23,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 20:05:23,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:23,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:23,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:05:23,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:05:23,979 INFO L85 PathProgramCache]: Analyzing trace with hash 41783452, now seen corresponding path program 1 times [2025-03-17 20:05:23,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:05:23,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240337915] [2025-03-17 20:05:23,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:05:23,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:05:23,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 20:05:23,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 20:05:23,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:23,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:23,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:05:24,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 20:05:24,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 20:05:24,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:24,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:24,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:05:24,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:05:24,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:05:24,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:24,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:24,571 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:05:24,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:05:24,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:05:24,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:05:24,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:05:24,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 08:05:24 BoogieIcfgContainer [2025-03-17 20:05:24,616 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 20:05:24,617 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 20:05:24,617 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 20:05:24,617 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 20:05:24,618 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:05:08" (3/4) ... [2025-03-17 20:05:24,620 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-17 20:05:24,668 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 20:05:24,668 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 20:05:24,669 INFO L158 Benchmark]: Toolchain (without parser) took 17530.50ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 122.1MB in the beginning and 813.7MB in the end (delta: -691.6MB). Peak memory consumption was 446.4MB. Max. memory is 16.1GB. [2025-03-17 20:05:24,669 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:05:24,670 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.35ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 94.5MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 20:05:24,670 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.49ms. Allocated memory is still 167.8MB. Free memory was 94.5MB in the beginning and 89.1MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:05:24,670 INFO L158 Benchmark]: Boogie Preprocessor took 63.30ms. Allocated memory is still 167.8MB. Free memory was 89.1MB in the beginning and 84.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:05:24,671 INFO L158 Benchmark]: IcfgBuilder took 799.77ms. Allocated memory is still 167.8MB. Free memory was 84.7MB in the beginning and 94.0MB in the end (delta: -9.3MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. [2025-03-17 20:05:24,671 INFO L158 Benchmark]: BuchiAutomizer took 16249.65ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 94.0MB in the beginning and 817.6MB in the end (delta: -723.7MB). Peak memory consumption was 421.0MB. Max. memory is 16.1GB. [2025-03-17 20:05:24,671 INFO L158 Benchmark]: Witness Printer took 50.90ms. Allocated memory is still 1.3GB. Free memory was 817.6MB in the beginning and 813.7MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:05:24,672 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.21ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.35ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 94.5MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.49ms. Allocated memory is still 167.8MB. Free memory was 94.5MB in the beginning and 89.1MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.30ms. Allocated memory is still 167.8MB. Free memory was 89.1MB in the beginning and 84.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 799.77ms. Allocated memory is still 167.8MB. Free memory was 84.7MB in the beginning and 94.0MB in the end (delta: -9.3MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 16249.65ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 94.0MB in the beginning and 817.6MB in the end (delta: -723.7MB). Peak memory consumption was 421.0MB. Max. memory is 16.1GB. * Witness Printer took 50.90ms. Allocated memory is still 1.3GB. Free memory was 817.6MB in the beginning and 813.7MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function a20 and consists of 4 locations. One deterministic module has affine ranking function a8 and consists of 4 locations. One deterministic module has affine ranking function a17 and consists of 4 locations. One deterministic module has affine ranking function a7 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 41569 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 9.9s. Construction of modules took 1.9s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 7. Automata minimization 1.6s AutomataMinimizationTime, 7 MinimizatonAttempts, 4000 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.8s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1042 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1038 mSDsluCounter, 226 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3387 IncrementalHoareTripleChecker+Invalid, 3573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 186 mSolverCounterUnsat, 184 mSDtfsCounter, 3387 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT2 conc1 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital44 mio100 ax100 hnf100 lsp39 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq208 hnf96 smp100 dnf139 smp100 tf104 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 20 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 593]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L42] a16 = 5 [L43] a20 = 0 [L44] return 24; VAL [\result=24, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) Loop: [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L326] COND TRUE (((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15)) [L327] return 24; [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 593]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L42] a16 = 5 [L43] a20 = 0 [L44] return 24; VAL [\result=24, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) Loop: [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L326] COND TRUE (((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15)) [L327] return 24; [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-17 20:05:24,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)