./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/float-benchs/bary_diverge.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/float-benchs/bary_diverge.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 b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:40:08,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:40:08,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:40:08,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:40:08,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:40:08,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:40:08,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:40:08,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:40:08,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:40:08,653 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:40:08,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:40:08,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:40:08,655 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:40:08,655 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:40:08,656 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:40:08,657 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:40:08,657 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:40:08,658 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:40:08,660 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:40:08,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:40:08,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:40:08,661 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:40:08,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:40:08,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:40:08,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:40:08,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:40:08,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:40:08,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:40:08,662 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:40:08,663 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:40:08,663 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:40:08,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:40:08,663 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:40:08,663 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:40:08,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:40:08,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:40:08,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:40:08,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:40:08,665 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:40:08,665 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 [2024-11-19 14:40:08,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:40:08,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:40:08,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:40:08,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:40:08,949 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:40:08,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/bary_diverge.c [2024-11-19 14:40:10,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:40:10,531 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:40:10,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/bary_diverge.c [2024-11-19 14:40:10,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eeb5a4be/9b9538106fd2418681e0c467508623e4/FLAGd89226eae [2024-11-19 14:40:10,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eeb5a4be/9b9538106fd2418681e0c467508623e4 [2024-11-19 14:40:10,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:40:10,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:40:10,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:40:10,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:40:10,922 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:40:10,923 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:40:10" (1/1) ... [2024-11-19 14:40:10,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c9c362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:10, skipping insertion in model container [2024-11-19 14:40:10,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:40:10" (1/1) ... [2024-11-19 14:40:10,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:40:11,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:40:11,133 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:40:11,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:40:11,165 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:40:11,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:11 WrapperNode [2024-11-19 14:40:11,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:40:11,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:40:11,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:40:11,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:40:11,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:11" (1/1) ... [2024-11-19 14:40:11,182 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:11" (1/1) ... [2024-11-19 14:40:11,207 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 110 [2024-11-19 14:40:11,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:40:11,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:40:11,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:40:11,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:40:11,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:11" (1/1) ... [2024-11-19 14:40:11,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:11" (1/1) ... [2024-11-19 14:40:11,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:11" (1/1) ... [2024-11-19 14:40:11,248 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 14:40:11,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:11" (1/1) ... [2024-11-19 14:40:11,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:11" (1/1) ... [2024-11-19 14:40:11,256 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:11" (1/1) ... [2024-11-19 14:40:11,264 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:11" (1/1) ... [2024-11-19 14:40:11,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:11" (1/1) ... [2024-11-19 14:40:11,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:11" (1/1) ... [2024-11-19 14:40:11,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:40:11,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:40:11,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:40:11,277 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:40:11,278 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:11" (1/1) ... [2024-11-19 14:40:11,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:40:11,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:40:11,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:40:11,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:40:11,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 14:40:11,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 14:40:11,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:40:11,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:40:11,456 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:40:11,458 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:40:11,621 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-19 14:40:11,621 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:40:11,634 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:40:11,634 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 14:40:11,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:40:11 BoogieIcfgContainer [2024-11-19 14:40:11,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:40:11,636 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:40:11,636 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:40:11,640 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:40:11,641 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:40:11,643 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:40:10" (1/3) ... [2024-11-19 14:40:11,644 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e817783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:40:11, skipping insertion in model container [2024-11-19 14:40:11,644 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:40:11,644 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:11" (2/3) ... [2024-11-19 14:40:11,644 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e817783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:40:11, skipping insertion in model container [2024-11-19 14:40:11,645 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:40:11,645 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:40:11" (3/3) ... [2024-11-19 14:40:11,646 INFO L332 chiAutomizerObserver]: Analyzing ICFG bary_diverge.c [2024-11-19 14:40:11,707 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:40:11,707 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:40:11,708 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:40:11,708 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:40:11,708 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:40:11,708 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:40:11,709 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:40:11,709 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:40:11,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:40:11,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2024-11-19 14:40:11,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:40:11,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:40:11,741 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:40:11,741 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:40:11,742 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:40:11,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:40:11,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2024-11-19 14:40:11,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:40:11,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:40:11,747 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:40:11,748 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:40:11,755 INFO L745 eck$LassoCheckResult]: Stem: 32#$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(15, 2);call #Ultimate.allocInit(12, 3);~INIT~0 := 0;~C1~0 := 0.0;~I~0 := 0.0;~X~0 := 0.0;~Y~0 := 0.0;~Z~0 := 0.0; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~ret6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~ret9#1, main_#t~post10#1, main_~i~0#1;havoc main_~i~0#1;~INIT~0 := 1;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.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; 18#L12true assume !(0 == assume_abort_if_not_~cond#1); 15#L11true havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 16#RANDOM_INPUT_returnLabel#1true main_#t~ret5#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~C1~0 := main_#t~ret5#1;havoc main_#t~ret5#1;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.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; 2#L12-2true assume 0 == assume_abort_if_not_~cond#1;assume false; 10#L11-1true havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 20#RANDOM_INPUT_returnLabel#2true main_#t~ret6#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~I~0 := main_#t~ret6#1;havoc main_#t~ret6#1;main_~i~0#1 := 0; 21#L61-3true [2024-11-19 14:40:11,757 INFO L747 eck$LassoCheckResult]: Loop: 21#L61-3true assume !!(main_~i~0#1 < 3600000);assume { :begin_inline_bary } true; 22#L36true assume !~someBinaryFLOATComparisonOperation(~C1~0, 0.0); 9#L36-2true assume 1 == ~INIT~0;~X~0 := ~I~0;~Y~0 := ~I~0;~Z~0 := ~I~0; 8#L41-1true assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(~X~0, ~someUnaryFLOAToperation(5.0)) && ~someBinaryFLOATComparisonOperation(~X~0, 5.0) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 25#L14true assume !(0 == __VERIFIER_assert_~cond#1); 28#L14-3true havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 23#L32true assume { :end_inline_bary } true;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.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#L12-4true assume 0 == assume_abort_if_not_~cond#1;assume false; 26#L11-2true havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 6#RANDOM_INPUT_returnLabel#3true main_#t~ret7#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~INIT~0 := ~convertFLOATToINT(main_#t~ret7#1);havoc main_#t~ret7#1;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.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; 29#L12-6true assume 0 == assume_abort_if_not_~cond#1;assume false; 24#L11-3true havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 19#RANDOM_INPUT_returnLabel#4true main_#t~ret8#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~C1~0 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.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; 31#L12-8true assume 0 == assume_abort_if_not_~cond#1;assume false; 11#L11-4true havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 5#RANDOM_INPUT_returnLabel#5true main_#t~ret9#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~I~0 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_wait_for_clock } true; 4#L30true assume { :end_inline_wait_for_clock } true; 14#L61-2true main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 21#L61-3true [2024-11-19 14:40:11,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:40:11,763 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2024-11-19 14:40:11,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:40:11,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153826156] [2024-11-19 14:40:11,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:40:11,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:40:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:40:11,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:40:11,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:40:11,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153826156] [2024-11-19 14:40:11,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153826156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:40:11,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:40:11,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:40:11,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988431194] [2024-11-19 14:40:11,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:40:11,960 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:40:11,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:40:11,961 INFO L85 PathProgramCache]: Analyzing trace with hash 717176989, now seen corresponding path program 1 times [2024-11-19 14:40:11,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:40:11,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720236096] [2024-11-19 14:40:11,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:40:11,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:40:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:40:12,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:40:12,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:40:12,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720236096] [2024-11-19 14:40:12,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720236096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:40:12,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:40:12,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:40:12,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257999053] [2024-11-19 14:40:12,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:40:12,007 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:40:12,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:40:12,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 14:40:12,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 14:40:12,056 INFO L87 Difference]: Start difference. First operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:40:12,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:40:12,068 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-11-19 14:40:12,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2024-11-19 14:40:12,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-19 14:40:12,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 26 states and 28 transitions. [2024-11-19 14:40:12,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-19 14:40:12,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-19 14:40:12,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2024-11-19 14:40:12,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:40:12,079 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-19 14:40:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2024-11-19 14:40:12,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-19 14:40:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:40:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-19 14:40:12,108 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-19 14:40:12,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 14:40:12,115 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-19 14:40:12,116 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:40:12,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2024-11-19 14:40:12,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-19 14:40:12,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:40:12,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:40:12,118 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:40:12,119 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:40:12,120 INFO L745 eck$LassoCheckResult]: Stem: 96#$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(15, 2);call #Ultimate.allocInit(12, 3);~INIT~0 := 0;~C1~0 := 0.0;~I~0 := 0.0;~X~0 := 0.0;~Y~0 := 0.0;~Z~0 := 0.0; 78#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~ret6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~ret9#1, main_#t~post10#1, main_~i~0#1;havoc main_~i~0#1;~INIT~0 := 1;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.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; 79#L12 assume !(0 == assume_abort_if_not_~cond#1); 88#L11 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 89#RANDOM_INPUT_returnLabel#1 main_#t~ret5#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~C1~0 := main_#t~ret5#1;havoc main_#t~ret5#1;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.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; 71#L12-2 assume !(0 == assume_abort_if_not_~cond#1); 72#L11-1 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 84#RANDOM_INPUT_returnLabel#2 main_#t~ret6#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~I~0 := main_#t~ret6#1;havoc main_#t~ret6#1;main_~i~0#1 := 0; 87#L61-3 [2024-11-19 14:40:12,120 INFO L747 eck$LassoCheckResult]: Loop: 87#L61-3 assume !!(main_~i~0#1 < 3600000);assume { :begin_inline_bary } true; 92#L36 assume !~someBinaryFLOATComparisonOperation(~C1~0, 0.0); 82#L36-2 assume 1 == ~INIT~0;~X~0 := ~I~0;~Y~0 := ~I~0;~Z~0 := ~I~0; 80#L41-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(~X~0, ~someUnaryFLOAToperation(5.0)) && ~someBinaryFLOATComparisonOperation(~X~0, 5.0) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81#L14 assume !(0 == __VERIFIER_assert_~cond#1); 95#L14-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 94#L32 assume { :end_inline_bary } true;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.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; 85#L12-4 assume !(0 == assume_abort_if_not_~cond#1); 86#L11-2 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 76#RANDOM_INPUT_returnLabel#3 main_#t~ret7#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~INIT~0 := ~convertFLOATToINT(main_#t~ret7#1);havoc main_#t~ret7#1;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.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; 77#L12-6 assume !(0 == assume_abort_if_not_~cond#1); 93#L11-3 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 90#RANDOM_INPUT_returnLabel#4 main_#t~ret8#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~C1~0 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.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; 91#L12-8 assume !(0 == assume_abort_if_not_~cond#1); 83#L11-4 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 75#RANDOM_INPUT_returnLabel#5 main_#t~ret9#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~I~0 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_wait_for_clock } true; 73#L30 assume { :end_inline_wait_for_clock } true; 74#L61-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 87#L61-3 [2024-11-19 14:40:12,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:40:12,121 INFO L85 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2024-11-19 14:40:12,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:40:12,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248096744] [2024-11-19 14:40:12,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:40:12,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:40:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:40:12,156 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:40:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:40:12,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:40:12,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:40:12,195 INFO L85 PathProgramCache]: Analyzing trace with hash 610741983, now seen corresponding path program 1 times [2024-11-19 14:40:12,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:40:12,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20262909] [2024-11-19 14:40:12,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:40:12,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:40:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:40:12,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:40:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:40:12,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:40:12,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:40:12,270 INFO L85 PathProgramCache]: Analyzing trace with hash 70702570, now seen corresponding path program 1 times [2024-11-19 14:40:12,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:40:12,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648063855] [2024-11-19 14:40:12,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:40:12,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:40:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:40:12,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:40:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:40:12,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:40:12,593 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:40:12,594 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:40:12,594 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:40:12,594 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:40:12,595 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:40:12,595 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:40:12,595 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:40:12,595 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:40:12,595 INFO L132 ssoRankerPreferences]: Filename of dumped script: bary_diverge.c_Iteration2_Loop [2024-11-19 14:40:12,596 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:40:12,596 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:40:12,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,819 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:40:12,819 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:40:12,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:40:12,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:40:12,823 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:40:12,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-19 14:40:12,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:40:12,828 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:40:12,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-19 14:40:12,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:40:12,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:40:12,857 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:40:12,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-19 14:40:12,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:40:12,859 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:40:12,902 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:40:12,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-19 14:40:12,909 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:40:12,909 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:40:12,909 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:40:12,910 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:40:12,910 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:40:12,910 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:40:12,910 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:40:12,910 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:40:12,910 INFO L132 ssoRankerPreferences]: Filename of dumped script: bary_diverge.c_Iteration2_Loop [2024-11-19 14:40:12,911 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:40:12,911 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:40:12,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:12,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:13,076 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:40:13,081 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:40:13,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:40:13,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:40:13,083 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:40:13,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-19 14:40:13,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:40:13,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:40:13,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:40:13,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:40:13,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:40:13,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:40:13,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:40:13,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:40:13,101 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:40:13,104 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:40:13,104 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:40:13,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:40:13,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:40:13,123 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:40:13,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 14:40:13,125 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:40:13,125 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:40:13,126 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:40:13,126 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 7199999 Supporting invariants [] [2024-11-19 14:40:13,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-19 14:40:13,140 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:40:13,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:40:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:40:13,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:40:13,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:40:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:40:13,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:40:13,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:40:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:40:13,334 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:40:13,335 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 28 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:40:13,376 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 28 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 44 states and 49 transitions. Complement of second has 4 states. [2024-11-19 14:40:13,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:40:13,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:40:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2024-11-19 14:40:13,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 8 letters. Loop has 18 letters. [2024-11-19 14:40:13,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:40:13,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 26 letters. Loop has 18 letters. [2024-11-19 14:40:13,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:40:13,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 8 letters. Loop has 36 letters. [2024-11-19 14:40:13,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:40:13,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2024-11-19 14:40:13,385 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:40:13,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2024-11-19 14:40:13,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 14:40:13,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 14:40:13,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 14:40:13,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:40:13,386 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:40:13,386 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:40:13,386 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:40:13,386 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:40:13,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-19 14:40:13,386 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:40:13,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-19 14:40:13,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:40:13 BoogieIcfgContainer [2024-11-19 14:40:13,392 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:40:13,393 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:40:13,393 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:40:13,393 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:40:13,393 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:40:11" (3/4) ... [2024-11-19 14:40:13,395 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 14:40:13,396 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:40:13,397 INFO L158 Benchmark]: Toolchain (without parser) took 2481.69ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 111.0MB in the beginning and 116.1MB in the end (delta: -5.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-11-19 14:40:13,398 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 167.8MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:40:13,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.99ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 98.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 14:40:13,398 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.50ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 96.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:40:13,399 INFO L158 Benchmark]: Boogie Preprocessor took 63.18ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 94.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:40:13,399 INFO L158 Benchmark]: RCFGBuilder took 362.27ms. Allocated memory is still 167.8MB. Free memory was 94.7MB in the beginning and 81.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 14:40:13,400 INFO L158 Benchmark]: BuchiAutomizer took 1756.27ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 81.7MB in the beginning and 117.1MB in the end (delta: -35.4MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2024-11-19 14:40:13,400 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 237.0MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:40:13,404 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.22ms. Allocated memory is still 167.8MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.99ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 98.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.50ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 96.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.18ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 94.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 362.27ms. Allocated memory is still 167.8MB. Free memory was 94.7MB in the beginning and 81.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 1756.27ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 81.7MB in the beginning and 117.1MB in the end (delta: -35.4MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 237.0MB. Free memory is still 116.1MB. 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) + 7199999) 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.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. 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, 26 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 59 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital22 mio100 ax154 hnf100 lsp32 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf100 smp100 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 44ms 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-11-19 14:40:13,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 14:40:13,627 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