./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-?-c7c6ca5-m [2024-11-09 15:45:28,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:45:28,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 15:45:28,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:45:28,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:45:28,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:45:28,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:45:28,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:45:28,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:45:28,258 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:45:28,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:45:28,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:45:28,260 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:45:28,260 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:45:28,262 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:45:28,262 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:45:28,263 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:45:28,263 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:45:28,263 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:45:28,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:45:28,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:45:28,267 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 15:45:28,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:45:28,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 15:45:28,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:45:28,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:45:28,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:45:28,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:45:28,269 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:45:28,269 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:45:28,269 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 15:45:28,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:45:28,270 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:45:28,270 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:45:28,270 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:45:28,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:45:28,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:45:28,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:45:28,271 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:45:28,272 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-09 15:45:28,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:45:28,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:45:28,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:45:28,527 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:45:28,527 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:45:28,529 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-09 15:45:29,975 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:45:30,170 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:45:30,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/bary_diverge.c [2024-11-09 15:45:30,178 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19cb0b329/1a3e3a6e19d94ce3b12ba9cfcfe40241/FLAG45c7a2251 [2024-11-09 15:45:30,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19cb0b329/1a3e3a6e19d94ce3b12ba9cfcfe40241 [2024-11-09 15:45:30,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:45:30,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:45:30,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:45:30,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:45:30,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:45:30,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:45:30" (1/1) ... [2024-11-09 15:45:30,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eae25d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:45:30, skipping insertion in model container [2024-11-09 15:45:30,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:45:30" (1/1) ... [2024-11-09 15:45:30,220 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:45:30,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:45:30,430 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:45:30,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:45:30,470 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:45:30,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:45:30 WrapperNode [2024-11-09 15:45:30,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:45:30,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:45:30,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:45:30,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:45:30,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:45:30" (1/1) ... [2024-11-09 15:45:30,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:45:30" (1/1) ... [2024-11-09 15:45:30,511 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 110 [2024-11-09 15:45:30,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:45:30,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:45:30,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:45:30,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:45:30,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:45:30" (1/1) ... [2024-11-09 15:45:30,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:45:30" (1/1) ... [2024-11-09 15:45:30,529 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:45:30" (1/1) ... [2024-11-09 15:45:30,542 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 15:45:30,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:45:30" (1/1) ... [2024-11-09 15:45:30,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:45:30" (1/1) ... [2024-11-09 15:45:30,547 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:45:30" (1/1) ... [2024-11-09 15:45:30,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:45:30" (1/1) ... [2024-11-09 15:45:30,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:45:30" (1/1) ... [2024-11-09 15:45:30,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:45:30" (1/1) ... [2024-11-09 15:45:30,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:45:30,557 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:45:30,557 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:45:30,557 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:45:30,558 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:45:30" (1/1) ... [2024-11-09 15:45:30,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:45:30,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:45:30,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:45:30,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:45:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 15:45:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 15:45:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:45:30,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:45:30,739 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:45:30,742 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:45:30,922 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-09 15:45:30,923 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:45:30,941 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:45:30,942 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 15:45:30,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:45:30 BoogieIcfgContainer [2024-11-09 15:45:30,942 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:45:30,943 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:45:30,943 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:45:30,948 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:45:30,949 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:45:30,949 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:45:30" (1/3) ... [2024-11-09 15:45:30,950 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a93a4e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:45:30, skipping insertion in model container [2024-11-09 15:45:30,950 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:45:30,950 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:45:30" (2/3) ... [2024-11-09 15:45:30,951 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a93a4e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:45:30, skipping insertion in model container [2024-11-09 15:45:30,951 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:45:30,951 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:45:30" (3/3) ... [2024-11-09 15:45:30,952 INFO L332 chiAutomizerObserver]: Analyzing ICFG bary_diverge.c [2024-11-09 15:45:31,014 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:45:31,014 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:45:31,014 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:45:31,015 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:45:31,015 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:45:31,015 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:45:31,015 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:45:31,016 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:45:31,019 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-09 15:45:31,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2024-11-09 15:45:31,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:45:31,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:45:31,038 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:45:31,038 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:45:31,038 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:45:31,039 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-09 15:45:31,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2024-11-09 15:45:31,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:45:31,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:45:31,045 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:45:31,045 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:45:31,052 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-09 15:45:31,053 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-09 15:45:31,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:45:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2024-11-09 15:45:31,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:45:31,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974752662] [2024-11-09 15:45:31,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:45:31,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:45:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:45:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:45:31,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:45:31,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974752662] [2024-11-09 15:45:31,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974752662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:45:31,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:45:31,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:45:31,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088352034] [2024-11-09 15:45:31,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:45:31,213 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:45:31,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:45:31,214 INFO L85 PathProgramCache]: Analyzing trace with hash 717176989, now seen corresponding path program 1 times [2024-11-09 15:45:31,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:45:31,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000675597] [2024-11-09 15:45:31,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:45:31,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:45:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:45:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:45:31,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:45:31,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000675597] [2024-11-09 15:45:31,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000675597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:45:31,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:45:31,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:45:31,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503588992] [2024-11-09 15:45:31,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:45:31,259 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:45:31,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:45:31,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 15:45:31,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 15:45:31,288 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-09 15:45:31,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:45:31,295 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-11-09 15:45:31,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2024-11-09 15:45:31,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-09 15:45:31,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 26 states and 28 transitions. [2024-11-09 15:45:31,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-09 15:45:31,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-09 15:45:31,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2024-11-09 15:45:31,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:45:31,303 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-09 15:45:31,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2024-11-09 15:45:31,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-09 15:45:31,326 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-09 15:45:31,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-09 15:45:31,328 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-09 15:45:31,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 15:45:31,334 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-09 15:45:31,334 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:45:31,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2024-11-09 15:45:31,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-09 15:45:31,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:45:31,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:45:31,336 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:45:31,336 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:45:31,336 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-09 15:45:31,337 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-09 15:45:31,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:45:31,339 INFO L85 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2024-11-09 15:45:31,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:45:31,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574787460] [2024-11-09 15:45:31,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:45:31,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:45:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:45:31,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:45:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:45:31,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:45:31,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:45:31,431 INFO L85 PathProgramCache]: Analyzing trace with hash 610741983, now seen corresponding path program 1 times [2024-11-09 15:45:31,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:45:31,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195491414] [2024-11-09 15:45:31,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:45:31,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:45:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:45:31,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:45:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:45:31,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:45:31,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:45:31,478 INFO L85 PathProgramCache]: Analyzing trace with hash 70702570, now seen corresponding path program 1 times [2024-11-09 15:45:31,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:45:31,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888426635] [2024-11-09 15:45:31,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:45:31,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:45:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:45:31,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:45:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:45:31,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:45:31,895 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:45:31,896 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:45:31,896 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:45:31,896 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:45:31,897 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:45:31,897 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:45:31,897 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:45:31,897 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:45:31,897 INFO L132 ssoRankerPreferences]: Filename of dumped script: bary_diverge.c_Iteration2_Loop [2024-11-09 15:45:31,897 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:45:31,898 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:45:31,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:31,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:31,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:31,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:31,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:31,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:31,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:31,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:31,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:31,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:31,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:31,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:31,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:31,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:31,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:31,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:31,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:32,135 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:45:32,136 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:45:32,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:45:32,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:45:32,140 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:45:32,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-09 15:45:32,143 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:45:32,143 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:45:32,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-09 15:45:32,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:45:32,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:45:32,179 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:45:32,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-09 15:45:32,183 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:45:32,183 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:45:32,220 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:45:32,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-09 15:45:32,227 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:45:32,227 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:45:32,227 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:45:32,227 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:45:32,227 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:45:32,227 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:45:32,227 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:45:32,227 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:45:32,227 INFO L132 ssoRankerPreferences]: Filename of dumped script: bary_diverge.c_Iteration2_Loop [2024-11-09 15:45:32,227 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:45:32,227 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:45:32,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:32,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:32,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:32,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:32,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:32,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:32,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:32,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:32,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:32,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:32,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:32,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:32,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:32,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:32,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:32,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:32,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:45:32,408 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:45:32,412 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:45:32,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:45:32,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:45:32,416 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:45:32,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-09 15:45:32,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:45:32,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:45:32,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:45:32,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:45:32,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:45:32,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:45:32,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:45:32,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:45:32,435 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:45:32,445 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:45:32,445 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:45:32,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:45:32,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:45:32,548 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:45:32,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-09 15:45:32,550 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:45:32,550 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:45:32,550 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:45:32,551 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-09 15:45:32,562 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-09 15:45:32,565 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:45:32,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:45:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:45:32,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:45:32,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:45:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:45:32,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:45:32,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:45:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:45:32,778 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:45:32,780 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-09 15:45:32,822 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-09 15:45:32,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:45:32,825 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-09 15:45:32,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2024-11-09 15:45:32,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 8 letters. Loop has 18 letters. [2024-11-09 15:45:32,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:45:32,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 26 letters. Loop has 18 letters. [2024-11-09 15:45:32,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:45:32,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 8 letters. Loop has 36 letters. [2024-11-09 15:45:32,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:45:32,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2024-11-09 15:45:32,833 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:45:32,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2024-11-09 15:45:32,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 15:45:32,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 15:45:32,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 15:45:32,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:45:32,834 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:45:32,834 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:45:32,834 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:45:32,834 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:45:32,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 15:45:32,834 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:45:32,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 15:45:32,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:45:32 BoogieIcfgContainer [2024-11-09 15:45:32,841 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:45:32,842 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:45:32,842 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:45:32,842 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:45:32,842 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:45:30" (3/4) ... [2024-11-09 15:45:32,844 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 15:45:32,844 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:45:32,845 INFO L158 Benchmark]: Toolchain (without parser) took 2650.67ms. Allocated memory is still 174.1MB. Free memory was 145.2MB in the beginning and 76.9MB in the end (delta: 68.3MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. [2024-11-09 15:45:32,846 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory was 94.3MB in the beginning and 94.1MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:45:32,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.78ms. Allocated memory is still 174.1MB. Free memory was 145.0MB in the beginning and 135.9MB in the end (delta: 9.1MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-11-09 15:45:32,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.96ms. Allocated memory is still 174.1MB. Free memory was 135.9MB in the beginning and 133.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:45:32,847 INFO L158 Benchmark]: Boogie Preprocessor took 43.81ms. Allocated memory is still 174.1MB. Free memory was 133.8MB in the beginning and 131.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:45:32,848 INFO L158 Benchmark]: RCFGBuilder took 385.31ms. Allocated memory is still 174.1MB. Free memory was 131.7MB in the beginning and 119.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 15:45:32,848 INFO L158 Benchmark]: BuchiAutomizer took 1897.86ms. Allocated memory is still 174.1MB. Free memory was 119.2MB in the beginning and 78.0MB in the end (delta: 41.2MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2024-11-09 15:45:32,849 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 174.1MB. Free memory was 78.0MB in the beginning and 76.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:45:32,851 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.12ms. Allocated memory is still 130.0MB. Free memory was 94.3MB in the beginning and 94.1MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.78ms. Allocated memory is still 174.1MB. Free memory was 145.0MB in the beginning and 135.9MB in the end (delta: 9.1MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.96ms. Allocated memory is still 174.1MB. Free memory was 135.9MB in the beginning and 133.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.81ms. Allocated memory is still 174.1MB. Free memory was 133.8MB in the beginning and 131.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.31ms. Allocated memory is still 174.1MB. Free memory was 131.7MB in the beginning and 119.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 1897.86ms. Allocated memory is still 174.1MB. Free memory was 119.2MB in the beginning and 78.0MB in the end (delta: 41.2MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 174.1MB. Free memory was 78.0MB in the beginning and 76.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. 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: 137ms 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-09 15:45:32,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-09 15:45:33,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE