./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 d395d439ec4556dc83dba3523bab6fe5cf68ec358a108cd3824067669c5e9bc5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:40:18,361 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:40:18,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:40:18,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:40:18,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:40:18,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:40:18,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:40:18,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:40:18,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:40:18,473 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:40:18,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:40:18,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:40:18,475 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:40:18,475 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:40:18,475 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:40:18,475 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:40:18,476 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:40:18,477 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:40:18,477 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:40:18,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:40:18,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:40:18,478 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:40:18,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:40:18,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:40:18,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:40:18,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:40:18,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:40:18,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:40:18,480 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:40:18,480 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:40:18,480 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:40:18,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:40:18,481 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:40:18,481 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:40:18,481 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:40:18,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:40:18,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:40:18,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:40:18,484 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:40:18,484 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/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 -> d395d439ec4556dc83dba3523bab6fe5cf68ec358a108cd3824067669c5e9bc5 [2024-10-12 00:40:18,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:40:18,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:40:18,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:40:18,807 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:40:18,808 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:40:18,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c [2024-10-12 00:40:20,262 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:40:20,483 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:40:20,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c [2024-10-12 00:40:20,492 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9d520534d/323050b7f3b3485bbdaba03c160b703d/FLAG451d5e132 [2024-10-12 00:40:20,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9d520534d/323050b7f3b3485bbdaba03c160b703d [2024-10-12 00:40:20,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:40:20,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:40:20,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:40:20,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:40:20,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:40:20,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:40:20" (1/1) ... [2024-10-12 00:40:20,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72802483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:20, skipping insertion in model container [2024-10-12 00:40:20,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:40:20" (1/1) ... [2024-10-12 00:40:20,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:40:20,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:40:20,782 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:40:20,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:40:20,812 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:40:20,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:20 WrapperNode [2024-10-12 00:40:20,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:40:20,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:40:20,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:40:20,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:40:20,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:20" (1/1) ... [2024-10-12 00:40:20,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:20" (1/1) ... [2024-10-12 00:40:20,838 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 55 [2024-10-12 00:40:20,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:40:20,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:40:20,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:40:20,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:40:20,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:20" (1/1) ... [2024-10-12 00:40:20,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:20" (1/1) ... [2024-10-12 00:40:20,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:20" (1/1) ... [2024-10-12 00:40:20,857 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 00:40:20,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:20" (1/1) ... [2024-10-12 00:40:20,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:20" (1/1) ... [2024-10-12 00:40:20,860 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:20" (1/1) ... [2024-10-12 00:40:20,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:20" (1/1) ... [2024-10-12 00:40:20,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:20" (1/1) ... [2024-10-12 00:40:20,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:20" (1/1) ... [2024-10-12 00:40:20,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:40:20,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:40:20,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:40:20,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:40:20,866 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:20" (1/1) ... [2024-10-12 00:40:20,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:40:20,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:40:20,907 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:40:20,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:40:20,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:40:20,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:40:20,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:40:20,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:40:21,014 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:40:21,020 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:40:21,163 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-12 00:40:21,163 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:40:21,175 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:40:21,175 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 00:40:21,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:40:21 BoogieIcfgContainer [2024-10-12 00:40:21,176 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:40:21,177 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:40:21,177 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:40:21,181 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:40:21,182 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:40:21,183 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:40:20" (1/3) ... [2024-10-12 00:40:21,184 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d8f22cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:40:21, skipping insertion in model container [2024-10-12 00:40:21,185 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:40:21,185 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:40:20" (2/3) ... [2024-10-12 00:40:21,185 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d8f22cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:40:21, skipping insertion in model container [2024-10-12 00:40:21,185 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:40:21,185 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:40:21" (3/3) ... [2024-10-12 00:40:21,187 INFO L332 chiAutomizerObserver]: Analyzing ICFG rlim_invariant.c [2024-10-12 00:40:21,244 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:40:21,245 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:40:21,245 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:40:21,245 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:40:21,245 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:40:21,245 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:40:21,246 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:40:21,246 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:40:21,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:40:21,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-10-12 00:40:21,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:40:21,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:40:21,274 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:40:21,275 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:40:21,275 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:40:21,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:40:21,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-10-12 00:40:21,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:40:21,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:40:21,279 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:40:21,280 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:40:21,287 INFO L745 eck$LassoCheckResult]: Stem: 16#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~X~0#1, main_~Y~0#1, main_~S~0#1, main_~R~0#1, main_~D~0#1, main_~i~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~S~0#1;havoc main_~R~0#1;havoc main_~D~0#1;havoc main_~i~0#1;main_~Y~0#1 := ~convertINTToFLOAT(0);main_~i~0#1 := 0; 19#L19-3true [2024-10-12 00:40:21,288 INFO L747 eck$LassoCheckResult]: Loop: 19#L19-3true assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet4#1;main_~X~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~D~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(main_~X~0#1, ~someUnaryFLOAToperation(128.0)) && ~someBinaryFLOATComparisonOperation(main_~X~0#1, 128.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; 12#L8true assume 0 == assume_abort_if_not_~cond#1;assume false; 10#L7true 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_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(main_~D~0#1, 0.0) && ~someBinaryFLOATComparisonOperation(main_~D~0#1, 16.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; 6#L8-2true assume 0 == assume_abort_if_not_~cond#1;assume false; 9#L7-1true havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;main_~S~0#1 := main_~Y~0#1;main_~Y~0#1 := main_~X~0#1;main_~R~0#1 := ~someBinaryArithmeticFLOAToperation(main_~X~0#1, main_~S~0#1); 7#L29true assume ~someBinaryFLOATComparisonOperation(main_~R~0#1, ~someUnaryFLOAToperation(main_~D~0#1));main_~Y~0#1 := ~someBinaryArithmeticFLOAToperation(main_~S~0#1, main_~D~0#1); 4#L30-2true assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(main_~Y~0#1, ~someUnaryFLOAToperation(129.0)) && ~someBinaryFLOATComparisonOperation(main_~Y~0#1, 129.0) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 15#L10true assume !(0 == __VERIFIER_assert_~cond#1); 17#L10-3true havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3#L19-2true main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 19#L19-3true [2024-10-12 00:40:21,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:40:21,294 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:40:21,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:40:21,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420985198] [2024-10-12 00:40:21,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:40:21,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:40:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:40:21,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:40:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:40:21,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:40:21,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:40:21,426 INFO L85 PathProgramCache]: Analyzing trace with hash -642829643, now seen corresponding path program 1 times [2024-10-12 00:40:21,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:40:21,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672382073] [2024-10-12 00:40:21,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:40:21,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:40:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:40:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:40:21,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:40:21,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672382073] [2024-10-12 00:40:21,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672382073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:40:21,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:40:21,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:40:21,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856784775] [2024-10-12 00:40:21,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:40:21,494 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:40:21,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:40:21,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 00:40:21,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 00:40:21,524 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:40:21,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:40:21,529 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2024-10-12 00:40:21,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2024-10-12 00:40:21,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-10-12 00:40:21,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 15 transitions. [2024-10-12 00:40:21,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-12 00:40:21,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-12 00:40:21,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2024-10-12 00:40:21,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:40:21,536 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-10-12 00:40:21,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2024-10-12 00:40:21,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-12 00:40:21,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:40:21,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-10-12 00:40:21,558 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-10-12 00:40:21,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 00:40:21,563 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-10-12 00:40:21,563 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:40:21,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2024-10-12 00:40:21,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-10-12 00:40:21,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:40:21,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:40:21,564 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:40:21,564 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:40:21,565 INFO L745 eck$LassoCheckResult]: Stem: 57#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); 53#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~X~0#1, main_~Y~0#1, main_~S~0#1, main_~R~0#1, main_~D~0#1, main_~i~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~S~0#1;havoc main_~R~0#1;havoc main_~D~0#1;havoc main_~i~0#1;main_~Y~0#1 := ~convertINTToFLOAT(0);main_~i~0#1 := 0; 46#L19-3 [2024-10-12 00:40:21,565 INFO L747 eck$LassoCheckResult]: Loop: 46#L19-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet4#1;main_~X~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~D~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(main_~X~0#1, ~someUnaryFLOAToperation(128.0)) && ~someBinaryFLOATComparisonOperation(main_~X~0#1, 128.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; 55#L8 assume !(0 == assume_abort_if_not_~cond#1); 54#L7 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_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(main_~D~0#1, 0.0) && ~someBinaryFLOATComparisonOperation(main_~D~0#1, 16.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; 50#L8-2 assume !(0 == assume_abort_if_not_~cond#1); 51#L7-1 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;main_~S~0#1 := main_~Y~0#1;main_~Y~0#1 := main_~X~0#1;main_~R~0#1 := ~someBinaryArithmeticFLOAToperation(main_~X~0#1, main_~S~0#1); 52#L29 assume ~someBinaryFLOATComparisonOperation(main_~R~0#1, ~someUnaryFLOAToperation(main_~D~0#1));main_~Y~0#1 := ~someBinaryArithmeticFLOAToperation(main_~S~0#1, main_~D~0#1); 47#L30-2 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(main_~Y~0#1, ~someUnaryFLOAToperation(129.0)) && ~someBinaryFLOATComparisonOperation(main_~Y~0#1, 129.0) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48#L10 assume !(0 == __VERIFIER_assert_~cond#1); 56#L10-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 45#L19-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 46#L19-3 [2024-10-12 00:40:21,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:40:21,566 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-12 00:40:21,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:40:21,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247190516] [2024-10-12 00:40:21,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:40:21,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:40:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:40:21,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:40:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:40:21,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:40:21,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:40:21,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1812236089, now seen corresponding path program 1 times [2024-10-12 00:40:21,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:40:21,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067594956] [2024-10-12 00:40:21,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:40:21,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:40:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:40:21,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:40:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:40:21,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:40:21,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:40:21,631 INFO L85 PathProgramCache]: Analyzing trace with hash -278118277, now seen corresponding path program 1 times [2024-10-12 00:40:21,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:40:21,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475463644] [2024-10-12 00:40:21,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:40:21,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:40:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:40:21,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:40:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:40:21,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:40:21,873 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:40:21,874 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:40:21,874 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:40:21,874 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:40:21,874 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:40:21,875 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:40:21,875 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:40:21,875 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:40:21,875 INFO L132 ssoRankerPreferences]: Filename of dumped script: rlim_invariant.c_Iteration2_Loop [2024-10-12 00:40:21,875 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:40:21,875 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:40:21,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:21,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:21,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:21,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:21,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:21,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:21,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:21,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:21,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:21,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:21,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:21,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:22,068 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:40:22,069 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:40:22,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:40:22,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:40:22,075 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:40:22,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:40:22,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:40:22,083 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:40:22,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:40:22,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:40:22,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:40:22,116 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:40:22,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:40:22,118 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:40:22,118 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:40:22,157 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:40:22,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-12 00:40:22,163 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:40:22,163 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:40:22,163 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:40:22,163 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:40:22,163 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:40:22,163 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:40:22,163 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:40:22,164 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:40:22,164 INFO L132 ssoRankerPreferences]: Filename of dumped script: rlim_invariant.c_Iteration2_Loop [2024-10-12 00:40:22,164 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:40:22,164 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:40:22,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:22,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:22,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:22,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:22,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:22,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:22,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:22,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:22,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:22,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:22,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:22,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:40:22,265 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:40:22,270 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:40:22,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:40:22,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:40:22,274 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:40:22,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:40:22,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:40:22,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:40:22,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:40:22,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:40:22,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:40:22,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:40:22,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:40:22,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:40:22,297 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:40:22,303 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:40:22,304 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:40:22,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:40:22,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:40:22,327 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:40:22,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:40:22,330 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:40:22,330 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:40:22,330 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:40:22,331 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 199999 Supporting invariants [] [2024-10-12 00:40:22,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-12 00:40:22,346 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:40:22,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:40:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:40:22,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:40:22,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:40:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:40:22,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:40:22,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:40:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:40:22,520 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:40:22,522 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) [2024-10-12 00:40:22,574 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 24 states and 29 transitions. Complement of second has 4 states. [2024-10-12 00:40:22,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:40:22,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) [2024-10-12 00:40:22,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-10-12 00:40:22,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 2 letters. Loop has 10 letters. [2024-10-12 00:40:22,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:40:22,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 12 letters. Loop has 10 letters. [2024-10-12 00:40:22,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:40:22,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 2 letters. Loop has 20 letters. [2024-10-12 00:40:22,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:40:22,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2024-10-12 00:40:22,584 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:40:22,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2024-10-12 00:40:22,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:40:22,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:40:22,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:40:22,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:40:22,586 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:40:22,586 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:40:22,586 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:40:22,586 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:40:22,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:40:22,586 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:40:22,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:40:22,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:40:22 BoogieIcfgContainer [2024-10-12 00:40:22,594 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:40:22,594 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:40:22,595 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:40:22,595 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:40:22,595 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:40:21" (3/4) ... [2024-10-12 00:40:22,598 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:40:22,599 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:40:22,600 INFO L158 Benchmark]: Toolchain (without parser) took 2086.39ms. Allocated memory is still 182.5MB. Free memory was 107.3MB in the beginning and 78.8MB in the end (delta: 28.6MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2024-10-12 00:40:22,600 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 182.5MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:40:22,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.44ms. Allocated memory is still 182.5MB. Free memory was 107.1MB in the beginning and 151.3MB in the end (delta: -44.2MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-10-12 00:40:22,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.52ms. Allocated memory is still 182.5MB. Free memory was 151.3MB in the beginning and 150.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:40:22,602 INFO L158 Benchmark]: Boogie Preprocessor took 25.78ms. Allocated memory is still 182.5MB. Free memory was 150.2MB in the beginning and 148.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:40:22,602 INFO L158 Benchmark]: RCFGBuilder took 310.56ms. Allocated memory is still 182.5MB. Free memory was 148.1MB in the beginning and 149.0MB in the end (delta: -907.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 00:40:22,603 INFO L158 Benchmark]: BuchiAutomizer took 1416.87ms. Allocated memory is still 182.5MB. Free memory was 148.1MB in the beginning and 79.5MB in the end (delta: 68.7MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2024-10-12 00:40:22,603 INFO L158 Benchmark]: Witness Printer took 5.05ms. Allocated memory is still 182.5MB. Free memory was 79.5MB in the beginning and 78.8MB in the end (delta: 677.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:40:22,606 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.18ms. Allocated memory is still 182.5MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.44ms. Allocated memory is still 182.5MB. Free memory was 107.1MB in the beginning and 151.3MB in the end (delta: -44.2MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.52ms. Allocated memory is still 182.5MB. Free memory was 151.3MB in the beginning and 150.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.78ms. Allocated memory is still 182.5MB. Free memory was 150.2MB in the beginning and 148.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 310.56ms. Allocated memory is still 182.5MB. Free memory was 148.1MB in the beginning and 149.0MB in the end (delta: -907.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 1416.87ms. Allocated memory is still 182.5MB. Free memory was 148.1MB in the beginning and 79.5MB in the end (delta: 68.7MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * Witness Printer took 5.05ms. Allocated memory is still 182.5MB. Free memory was 79.5MB in the beginning and 78.8MB in the end (delta: 677.4kB). 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) + 199999) 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.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. 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, 13 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 33 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: 59ms 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! [2024-10-12 00:40:22,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-12 00:40:22,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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