./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/float-benchs/zonotope_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed 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/float-benchs/zonotope_3.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 c1619194307da84227512f62eb582bffd66266544ce804bd80ee6a40fe157ac7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 07:13:49,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 07:13:49,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 07:13:49,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 07:13:49,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 07:13:49,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 07:13:49,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 07:13:49,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 07:13:49,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 07:13:49,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 07:13:49,446 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 07:13:49,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 07:13:49,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 07:13:49,447 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 07:13:49,447 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 07:13:49,447 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 07:13:49,447 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 07:13:49,447 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 07:13:49,447 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 07:13:49,447 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 07:13:49,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 07:13:49,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 07:13:49,448 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 07:13:49,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 07:13:49,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 07:13:49,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 07:13:49,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 07:13:49,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 07:13:49,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 07:13:49,448 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 07:13:49,448 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 07:13:49,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 07:13:49,448 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 07:13:49,449 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 07:13:49,449 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 07:13:49,449 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 07:13:49,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 07:13:49,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 07:13:49,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 07:13:49,449 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 07:13:49,449 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 -> c1619194307da84227512f62eb582bffd66266544ce804bd80ee6a40fe157ac7 [2025-03-09 07:13:49,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 07:13:49,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 07:13:49,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 07:13:49,676 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 07:13:49,676 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 07:13:49,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/zonotope_3.c [2025-03-09 07:13:50,891 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df32ef18/b288659eb2d14a22b4427cfacb8da44d/FLAG872addb8a [2025-03-09 07:13:51,101 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 07:13:51,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_3.c [2025-03-09 07:13:51,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df32ef18/b288659eb2d14a22b4427cfacb8da44d/FLAG872addb8a [2025-03-09 07:13:51,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df32ef18/b288659eb2d14a22b4427cfacb8da44d [2025-03-09 07:13:51,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 07:13:51,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 07:13:51,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 07:13:51,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 07:13:51,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 07:13:51,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:13:51" (1/1) ... [2025-03-09 07:13:51,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a2f6e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:51, skipping insertion in model container [2025-03-09 07:13:51,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:13:51" (1/1) ... [2025-03-09 07:13:51,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 07:13:51,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:13:51,589 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 07:13:51,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:13:51,615 INFO L204 MainTranslator]: Completed translation [2025-03-09 07:13:51,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:51 WrapperNode [2025-03-09 07:13:51,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 07:13:51,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 07:13:51,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 07:13:51,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 07:13:51,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:51" (1/1) ... [2025-03-09 07:13:51,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:51" (1/1) ... [2025-03-09 07:13:51,642 INFO L138 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 87 [2025-03-09 07:13:51,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 07:13:51,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 07:13:51,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 07:13:51,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 07:13:51,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:51" (1/1) ... [2025-03-09 07:13:51,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:51" (1/1) ... [2025-03-09 07:13:51,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:51" (1/1) ... [2025-03-09 07:13:51,657 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-09 07:13:51,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:51" (1/1) ... [2025-03-09 07:13:51,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:51" (1/1) ... [2025-03-09 07:13:51,664 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:51" (1/1) ... [2025-03-09 07:13:51,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:51" (1/1) ... [2025-03-09 07:13:51,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:51" (1/1) ... [2025-03-09 07:13:51,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:51" (1/1) ... [2025-03-09 07:13:51,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 07:13:51,667 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 07:13:51,667 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 07:13:51,667 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 07:13:51,668 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:51" (1/1) ... [2025-03-09 07:13:51,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:51,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:51,695 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-09 07:13:51,702 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-09 07:13:51,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 07:13:51,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 07:13:51,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 07:13:51,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 07:13:51,770 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 07:13:51,772 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 07:13:51,862 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2025-03-09 07:13:51,863 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 07:13:51,869 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 07:13:51,870 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 07:13:51,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:13:51 BoogieIcfgContainer [2025-03-09 07:13:51,870 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 07:13:51,871 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 07:13:51,871 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 07:13:51,874 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 07:13:51,875 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:13:51,875 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 07:13:51" (1/3) ... [2025-03-09 07:13:51,875 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@275e20b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:13:51, skipping insertion in model container [2025-03-09 07:13:51,876 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:13:51,876 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:51" (2/3) ... [2025-03-09 07:13:51,876 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@275e20b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:13:51, skipping insertion in model container [2025-03-09 07:13:51,876 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:13:51,876 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:13:51" (3/3) ... [2025-03-09 07:13:51,878 INFO L363 chiAutomizerObserver]: Analyzing ICFG zonotope_3.c [2025-03-09 07:13:51,914 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 07:13:51,914 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 07:13:51,914 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 07:13:51,915 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 07:13:51,915 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 07:13:51,915 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 07:13:51,915 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 07:13:51,916 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 07:13:51,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:13:51,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-09 07:13:51,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:13:51,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:13:51,933 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 07:13:51,933 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:13:51,933 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 07:13:51,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:13:51,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-09 07:13:51,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:13:51,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:13:51,936 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 07:13:51,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:13:51,940 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(13, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_#t~ret5#1, main_#t~ret6#1, main_#t~ret7#1, main_#t~nondet8#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~ret11#1, main_#t~ret12#1, main_#t~post13#1, main_~i~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1, main_~t~0#1, main_~u~0#1, main_~v~0#1;havoc main_~i~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;havoc main_~t~0#1;havoc main_~u~0#1;havoc main_~v~0#1;assume { :begin_inline_f } true;f_#in~x#1 := 0.0;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(2.0, f_~x#1), 3.0);" "main_#t~ret4#1 := f_#res#1;havoc f_~x#1;havoc f_#in~x#1;assume { :end_inline_f } true;main_~y~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline_g } true;g_#in~x#1 := 0.0;havoc g_#res#1;havoc g_~x#1;g_~x#1 := g_#in~x#1;g_#res#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(g_~x#1), 5.0);" "main_#t~ret5#1 := g_#res#1;havoc g_~x#1;havoc g_#in~x#1;assume { :end_inline_g } true;main_~z~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1;assume { :begin_inline_f } true;f_#in~x#1 := 0.75;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(2.0, f_~x#1), 3.0);" "main_#t~ret6#1 := f_#res#1;havoc f_~x#1;havoc f_#in~x#1;assume { :end_inline_f } true;main_~u~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1;assume { :begin_inline_g } true;g_#in~x#1 := 0.25;havoc g_#res#1;havoc g_~x#1;g_~x#1 := g_#in~x#1;g_#res#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(g_~x#1), 5.0);" "main_#t~ret7#1 := g_#res#1;havoc g_~x#1;havoc g_#in~x#1;assume { :end_inline_g } true;main_~v~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_~i~0#1 := 1;" [2025-03-09 07:13:51,941 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 <= 100000;havoc main_#t~nondet8#1;main_~x~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(main_~x~0#1, 0.0) && ~someBinaryFLOATComparisonOperation(main_~x~0#1, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(main_~i~0#1), 100000.0)) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume 0 == assume_abort_if_not_~cond#1;assume false;" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_f } true;f_#in~x#1 := main_~x~0#1;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(2.0, f_~x#1), 3.0);" "main_#t~ret9#1 := f_#res#1;havoc f_~x#1;havoc f_#in~x#1;assume { :end_inline_f } true;main_~y~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_g } true;g_#in~x#1 := main_~x~0#1;havoc g_#res#1;havoc g_~x#1;g_~x#1 := g_#in~x#1;g_#res#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(g_~x#1), 5.0);" "main_#t~ret10#1 := g_#res#1;havoc g_~x#1;havoc g_#in~x#1;assume { :end_inline_g } true;main_~z~0#1 := main_#t~ret10#1;havoc main_#t~ret10#1;assume { :begin_inline_f } true;f_#in~x#1 := main_~v~0#1;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(2.0, f_~x#1), 3.0);" "main_#t~ret11#1 := f_#res#1;havoc f_~x#1;havoc f_#in~x#1;assume { :end_inline_f } true;main_~u~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;assume { :begin_inline_g } true;g_#in~x#1 := main_~u~0#1;havoc g_#res#1;havoc g_~x#1;g_~x#1 := g_#in~x#1;g_#res#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(g_~x#1), 5.0);" "main_#t~ret12#1 := g_#res#1;havoc g_~x#1;havoc g_#in~x#1;assume { :end_inline_g } true;main_~v~0#1 := ~someBinaryArithmeticFLOAToperation(main_#t~ret12#1, 2.0);havoc main_#t~ret12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;" [2025-03-09 07:13:51,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:13:51,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1773989436, now seen corresponding path program 1 times [2025-03-09 07:13:51,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:13:51,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928917593] [2025-03-09 07:13:51,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:13:51,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:13:51,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:13:52,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:13:52,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:52,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:13:52,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:13:52,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:13:52,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:13:52,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:52,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:13:52,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:13:52,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:13:52,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1450468242, now seen corresponding path program 1 times [2025-03-09 07:13:52,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:13:52,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334092385] [2025-03-09 07:13:52,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:13:52,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:13:52,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:13:52,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:13:52,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:52,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:13:52,083 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-09 07:13:52,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:13:52,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334092385] [2025-03-09 07:13:52,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334092385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:13:52,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:13:52,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 07:13:52,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765298617] [2025-03-09 07:13:52,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:13:52,091 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:13:52,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:13:52,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 07:13:52,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 07:13:52,112 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-09 07:13:52,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:13:52,117 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2025-03-09 07:13:52,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 19 transitions. [2025-03-09 07:13:52,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-09 07:13:52,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 13 states and 13 transitions. [2025-03-09 07:13:52,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-09 07:13:52,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 07:13:52,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 13 transitions. [2025-03-09 07:13:52,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:13:52,128 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-03-09 07:13:52,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 13 transitions. [2025-03-09 07:13:52,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-09 07:13:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.0) internal successors, (13), 12 states have internal predecessors, (13), 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-09 07:13:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2025-03-09 07:13:52,148 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-03-09 07:13:52,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 07:13:52,151 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-03-09 07:13:52,152 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 07:13:52,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 13 transitions. [2025-03-09 07:13:52,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-09 07:13:52,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:13:52,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:13:52,153 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 07:13:52,154 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:13:52,154 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(13, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_#t~ret5#1, main_#t~ret6#1, main_#t~ret7#1, main_#t~nondet8#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~ret11#1, main_#t~ret12#1, main_#t~post13#1, main_~i~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1, main_~t~0#1, main_~u~0#1, main_~v~0#1;havoc main_~i~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;havoc main_~t~0#1;havoc main_~u~0#1;havoc main_~v~0#1;assume { :begin_inline_f } true;f_#in~x#1 := 0.0;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(2.0, f_~x#1), 3.0);" "main_#t~ret4#1 := f_#res#1;havoc f_~x#1;havoc f_#in~x#1;assume { :end_inline_f } true;main_~y~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline_g } true;g_#in~x#1 := 0.0;havoc g_#res#1;havoc g_~x#1;g_~x#1 := g_#in~x#1;g_#res#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(g_~x#1), 5.0);" "main_#t~ret5#1 := g_#res#1;havoc g_~x#1;havoc g_#in~x#1;assume { :end_inline_g } true;main_~z~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1;assume { :begin_inline_f } true;f_#in~x#1 := 0.75;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(2.0, f_~x#1), 3.0);" "main_#t~ret6#1 := f_#res#1;havoc f_~x#1;havoc f_#in~x#1;assume { :end_inline_f } true;main_~u~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1;assume { :begin_inline_g } true;g_#in~x#1 := 0.25;havoc g_#res#1;havoc g_~x#1;g_~x#1 := g_#in~x#1;g_#res#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(g_~x#1), 5.0);" "main_#t~ret7#1 := g_#res#1;havoc g_~x#1;havoc g_#in~x#1;assume { :end_inline_g } true;main_~v~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_~i~0#1 := 1;" [2025-03-09 07:13:52,154 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 <= 100000;havoc main_#t~nondet8#1;main_~x~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(main_~x~0#1, 0.0) && ~someBinaryFLOATComparisonOperation(main_~x~0#1, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(main_~i~0#1), 100000.0)) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_f } true;f_#in~x#1 := main_~x~0#1;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(2.0, f_~x#1), 3.0);" "main_#t~ret9#1 := f_#res#1;havoc f_~x#1;havoc f_#in~x#1;assume { :end_inline_f } true;main_~y~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_g } true;g_#in~x#1 := main_~x~0#1;havoc g_#res#1;havoc g_~x#1;g_~x#1 := g_#in~x#1;g_#res#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(g_~x#1), 5.0);" "main_#t~ret10#1 := g_#res#1;havoc g_~x#1;havoc g_#in~x#1;assume { :end_inline_g } true;main_~z~0#1 := main_#t~ret10#1;havoc main_#t~ret10#1;assume { :begin_inline_f } true;f_#in~x#1 := main_~v~0#1;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(2.0, f_~x#1), 3.0);" "main_#t~ret11#1 := f_#res#1;havoc f_~x#1;havoc f_#in~x#1;assume { :end_inline_f } true;main_~u~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;assume { :begin_inline_g } true;g_#in~x#1 := main_~u~0#1;havoc g_#res#1;havoc g_~x#1;g_~x#1 := g_#in~x#1;g_#res#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(g_~x#1), 5.0);" "main_#t~ret12#1 := g_#res#1;havoc g_~x#1;havoc g_#in~x#1;assume { :end_inline_g } true;main_~v~0#1 := ~someBinaryArithmeticFLOAToperation(main_#t~ret12#1, 2.0);havoc main_#t~ret12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;" [2025-03-09 07:13:52,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:13:52,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1773989436, now seen corresponding path program 2 times [2025-03-09 07:13:52,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:13:52,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417783656] [2025-03-09 07:13:52,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:13:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:13:52,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:13:52,171 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:13:52,172 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:13:52,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:13:52,172 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:13:52,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:13:52,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:13:52,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:52,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:13:52,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:13:52,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:13:52,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1421839091, now seen corresponding path program 1 times [2025-03-09 07:13:52,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:13:52,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817043882] [2025-03-09 07:13:52,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:13:52,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:13:52,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:13:52,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:13:52,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:52,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:13:52,202 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:13:52,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:13:52,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:13:52,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:52,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:13:52,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:13:52,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:13:52,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1587617394, now seen corresponding path program 1 times [2025-03-09 07:13:52,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:13:52,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911684737] [2025-03-09 07:13:52,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:13:52,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:13:52,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 07:13:52,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 07:13:52,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:52,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:13:52,244 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:13:52,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 07:13:52,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 07:13:52,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:52,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:13:52,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:13:52,372 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:13:52,373 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:13:52,373 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:13:52,373 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:13:52,373 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:13:52,373 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:52,374 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:13:52,374 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:13:52,374 INFO L132 ssoRankerPreferences]: Filename of dumped script: zonotope_3.c_Iteration2_Loop [2025-03-09 07:13:52,374 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:13:52,374 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:13:52,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,544 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:13:52,544 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:13:52,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:52,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:52,549 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-09 07:13:52,550 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-09 07:13:52,550 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:13:52,550 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:13:52,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-09 07:13:52,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:52,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:52,573 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-09 07:13:52,574 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-09 07:13:52,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:13:52,575 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:13:52,607 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:13:52,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-09 07:13:52,611 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:13:52,611 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:13:52,611 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:13:52,611 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:13:52,611 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:13:52,612 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:52,612 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:13:52,612 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:13:52,612 INFO L132 ssoRankerPreferences]: Filename of dumped script: zonotope_3.c_Iteration2_Loop [2025-03-09 07:13:52,612 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:13:52,612 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:13:52,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:52,717 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:13:52,719 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:13:52,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:52,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:52,722 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-09 07:13:52,724 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-09 07:13:52,725 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-09 07:13:52,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:52,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:13:52,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:52,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:52,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:52,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:13:52,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:13:52,746 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:13:52,750 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:13:52,751 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:13:52,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:52,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:52,755 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-09 07:13:52,759 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-09 07:13:52,760 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:13:52,760 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:13:52,761 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:13:52,761 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 200001 Supporting invariants [] [2025-03-09 07:13:52,767 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-09 07:13:52,770 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:13:52,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:13:52,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:13:52,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:13:52,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:52,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:13:52,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:13:52,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:13:52,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:13:52,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:13:52,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:52,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:13:52,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:13:52,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:13:52,893 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-09 07:13:52,895 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-09 07:13:52,896 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 13 transitions. cyclomatic complexity: 1 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-09 07:13:52,924 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 13 transitions. cyclomatic complexity: 1. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 20 states and 21 transitions. Complement of second has 4 states. [2025-03-09 07:13:52,927 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-09 07:13:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-09 07:13:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2025-03-09 07:13:52,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 6 letters. Loop has 7 letters. [2025-03-09 07:13:52,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:13:52,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 13 letters. Loop has 7 letters. [2025-03-09 07:13:52,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:13:52,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 6 letters. Loop has 14 letters. [2025-03-09 07:13:52,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:13:52,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2025-03-09 07:13:52,936 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:13:52,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2025-03-09 07:13:52,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 07:13:52,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 07:13:52,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 07:13:52,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:13:52,936 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:13:52,936 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:13:52,936 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:13:52,936 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 07:13:52,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 07:13:52,937 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:13:52,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 07:13:52,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 07:13:52 BoogieIcfgContainer [2025-03-09 07:13:52,942 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 07:13:52,943 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 07:13:52,943 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 07:13:52,943 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 07:13:52,944 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:13:51" (3/4) ... [2025-03-09 07:13:52,949 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 07:13:52,949 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 07:13:52,950 INFO L158 Benchmark]: Toolchain (without parser) took 1500.93ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 94.2MB in the end (delta: 19.4MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2025-03-09 07:13:52,950 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:13:52,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.09ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 102.2MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:13:52,951 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.34ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 100.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:13:52,951 INFO L158 Benchmark]: Boogie Preprocessor took 21.86ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:13:52,951 INFO L158 Benchmark]: IcfgBuilder took 203.49ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 86.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:13:52,951 INFO L158 Benchmark]: BuchiAutomizer took 1071.78ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 94.3MB in the end (delta: -7.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:13:52,951 INFO L158 Benchmark]: Witness Printer took 6.48ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 94.2MB in the end (delta: 63.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:13:52,954 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.09ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 102.2MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.34ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 100.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.86ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 203.49ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 86.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 1071.78ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 94.3MB in the end (delta: -7.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.48ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 94.2MB in the end (delta: 63.9kB). 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 200001) and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 30 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 40ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-09 07:13:52,964 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-09 07:13:53,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE