./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1619194307da84227512f62eb582bffd66266544ce804bd80ee6a40fe157ac7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:36:54,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:36:54,974 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-15 00:36:54,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:36:54,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:36:55,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:36:55,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:36:55,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:36:55,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:36:55,033 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:36:55,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:36:55,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:36:55,038 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:36:55,039 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:36:55,039 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:36:55,039 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:36:55,039 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:36:55,039 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:36:55,040 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:36:55,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:36:55,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:36:55,046 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 00:36:55,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:36:55,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 00:36:55,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:36:55,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:36:55,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:36:55,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:36:55,048 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:36:55,048 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:36:55,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 00:36:55,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:36:55,048 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:36:55,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:36:55,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:36:55,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:36:55,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:36:55,049 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:36:55,050 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:36:55,050 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 -> c1619194307da84227512f62eb582bffd66266544ce804bd80ee6a40fe157ac7 [2024-10-15 00:36:55,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:36:55,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:36:55,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:36:55,495 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:36:55,496 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:36:55,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_3.c [2024-10-15 00:36:57,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:36:57,364 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:36:57,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_3.c [2024-10-15 00:36:57,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d7a279e8/df177b5e03a64add9cf10741c6cd0412/FLAG10ab56a8c [2024-10-15 00:36:57,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d7a279e8/df177b5e03a64add9cf10741c6cd0412 [2024-10-15 00:36:57,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:36:57,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:36:57,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:36:57,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:36:57,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:36:57,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:36:57" (1/1) ... [2024-10-15 00:36:57,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@572d9f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:36:57, skipping insertion in model container [2024-10-15 00:36:57,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:36:57" (1/1) ... [2024-10-15 00:36:57,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:36:57,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:36:57,542 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:36:57,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:36:57,570 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:36:57,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:36:57 WrapperNode [2024-10-15 00:36:57,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:36:57,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:36:57,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:36:57,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:36:57,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:36:57" (1/1) ... [2024-10-15 00:36:57,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:36:57" (1/1) ... [2024-10-15 00:36:57,638 INFO L138 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 90 [2024-10-15 00:36:57,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:36:57,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:36:57,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:36:57,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:36:57,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:36:57" (1/1) ... [2024-10-15 00:36:57,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:36:57" (1/1) ... [2024-10-15 00:36:57,649 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:36:57" (1/1) ... [2024-10-15 00:36:57,657 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-15 00:36:57,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:36:57" (1/1) ... [2024-10-15 00:36:57,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:36:57" (1/1) ... [2024-10-15 00:36:57,661 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:36:57" (1/1) ... [2024-10-15 00:36:57,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:36:57" (1/1) ... [2024-10-15 00:36:57,664 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:36:57" (1/1) ... [2024-10-15 00:36:57,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:36:57" (1/1) ... [2024-10-15 00:36:57,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:36:57,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:36:57,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:36:57,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:36:57,668 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:36:57" (1/1) ... [2024-10-15 00:36:57,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:36:57,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:36:57,756 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-10-15 00:36:57,761 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-10-15 00:36:57,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 00:36:57,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 00:36:57,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:36:57,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:36:57,862 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:36:57,864 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:36:58,003 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-10-15 00:36:58,003 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:36:58,018 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:36:58,020 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-15 00:36:58,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:36:58 BoogieIcfgContainer [2024-10-15 00:36:58,020 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:36:58,021 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:36:58,021 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:36:58,025 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:36:58,025 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:36:58,026 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:36:57" (1/3) ... [2024-10-15 00:36:58,027 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ee9a2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:36:58, skipping insertion in model container [2024-10-15 00:36:58,027 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:36:58,028 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:36:57" (2/3) ... [2024-10-15 00:36:58,028 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ee9a2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:36:58, skipping insertion in model container [2024-10-15 00:36:58,028 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:36:58,029 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:36:58" (3/3) ... [2024-10-15 00:36:58,030 INFO L332 chiAutomizerObserver]: Analyzing ICFG zonotope_3.c [2024-10-15 00:36:58,082 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:36:58,082 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:36:58,083 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:36:58,083 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:36:58,083 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:36:58,083 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:36:58,084 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:36:58,084 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:36:58,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:36:58,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:36:58,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:36:58,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:36:58,106 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:36:58,106 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:36:58,107 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:36:58,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:36:58,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:36:58,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:36:58,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:36:58,109 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:36:58,109 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:36:58,115 INFO L745 eck$LassoCheckResult]: Stem: 18#$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(13, 2);call #Ultimate.allocInit(12, 3); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_#t~ret5#1, main_#t~ret6#1, main_#t~ret7#1, main_#t~nondet8#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~ret11#1, main_#t~ret12#1, main_#t~post13#1, main_~i~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1, main_~t~0#1, main_~u~0#1, main_~v~0#1;havoc main_~i~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;havoc main_~t~0#1;havoc main_~u~0#1;havoc main_~v~0#1;assume { :begin_inline_f } true;f_#in~x#1 := 0.0;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(2.0, f_~x#1), 3.0); 4#f_returnLabel#1true main_#t~ret4#1 := f_#res#1;havoc f_~x#1;havoc f_#in~x#1;assume { :end_inline_f } true;main_~y~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline_g } true;g_#in~x#1 := 0.0;havoc g_#res#1;havoc g_~x#1;g_~x#1 := g_#in~x#1;g_#res#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(g_~x#1), 5.0); 20#g_returnLabel#1true main_#t~ret5#1 := g_#res#1;havoc g_~x#1;havoc g_#in~x#1;assume { :end_inline_g } true;main_~z~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1;assume { :begin_inline_f } true;f_#in~x#1 := 0.75;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(2.0, f_~x#1), 3.0); 7#f_returnLabel#2true main_#t~ret6#1 := f_#res#1;havoc f_~x#1;havoc f_#in~x#1;assume { :end_inline_f } true;main_~u~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1;assume { :begin_inline_g } true;g_#in~x#1 := 0.25;havoc g_#res#1;havoc g_~x#1;g_~x#1 := g_#in~x#1;g_#res#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(g_~x#1), 5.0); 9#g_returnLabel#2true main_#t~ret7#1 := g_#res#1;havoc g_~x#1;havoc g_#in~x#1;assume { :end_inline_g } true;main_~v~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_~i~0#1 := 1; 10#L36-3true [2024-10-15 00:36:58,116 INFO L747 eck$LassoCheckResult]: Loop: 10#L36-3true assume !!(main_~i~0#1 <= 100000);havoc main_#t~nondet8#1;main_~x~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(main_~x~0#1, 0.0) && ~someBinaryFLOATComparisonOperation(main_~x~0#1, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(main_~i~0#1), 100000.0)) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 15#L13true assume 0 == assume_abort_if_not_~cond#1;assume false; 22#L12true havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_f } true;f_#in~x#1 := main_~x~0#1;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(2.0, f_~x#1), 3.0); 16#f_returnLabel#3true main_#t~ret9#1 := f_#res#1;havoc f_~x#1;havoc f_#in~x#1;assume { :end_inline_f } true;main_~y~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_g } true;g_#in~x#1 := main_~x~0#1;havoc g_#res#1;havoc g_~x#1;g_~x#1 := g_#in~x#1;g_#res#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(g_~x#1), 5.0); 3#g_returnLabel#3true main_#t~ret10#1 := g_#res#1;havoc g_~x#1;havoc g_#in~x#1;assume { :end_inline_g } true;main_~z~0#1 := main_#t~ret10#1;havoc main_#t~ret10#1;assume { :begin_inline_f } true;f_#in~x#1 := main_~v~0#1;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(2.0, f_~x#1), 3.0); 21#f_returnLabel#4true main_#t~ret11#1 := f_#res#1;havoc f_~x#1;havoc f_#in~x#1;assume { :end_inline_f } true;main_~u~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;assume { :begin_inline_g } true;g_#in~x#1 := main_~u~0#1;havoc g_#res#1;havoc g_~x#1;g_~x#1 := g_#in~x#1;g_#res#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(g_~x#1), 5.0); 12#g_returnLabel#4true main_#t~ret12#1 := g_#res#1;havoc g_~x#1;havoc g_#in~x#1;assume { :end_inline_g } true;main_~v~0#1 := ~someBinaryArithmeticFLOAToperation(main_#t~ret12#1, 2.0);havoc main_#t~ret12#1; 13#L36-2true main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 10#L36-3true [2024-10-15 00:36:58,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:36:58,124 INFO L85 PathProgramCache]: Analyzing trace with hash 889475911, now seen corresponding path program 1 times [2024-10-15 00:36:58,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:36:58,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041122030] [2024-10-15 00:36:58,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:36:58,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:36:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:36:58,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:36:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:36:58,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:36:58,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:36:58,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1697627242, now seen corresponding path program 1 times [2024-10-15 00:36:58,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:36:58,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506273847] [2024-10-15 00:36:58,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:36:58,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:36:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:36:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:36:58,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:36:58,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506273847] [2024-10-15 00:36:58,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506273847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:36:58,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:36:58,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 00:36:58,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845092712] [2024-10-15 00:36:58,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:36:58,296 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:36:58,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:36:58,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 00:36:58,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 00:36:58,325 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 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-10-15 00:36:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:36:58,331 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2024-10-15 00:36:58,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 21 transitions. [2024-10-15 00:36:58,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:36:58,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 14 states and 14 transitions. [2024-10-15 00:36:58,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-15 00:36:58,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-15 00:36:58,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 14 transitions. [2024-10-15 00:36:58,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:36:58,342 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-15 00:36:58,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 14 transitions. [2024-10-15 00:36:58,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-15 00:36:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.0) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:36:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-15 00:36:58,365 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-15 00:36:58,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 00:36:58,369 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-15 00:36:58,370 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:36:58,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 14 transitions. [2024-10-15 00:36:58,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:36:58,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:36:58,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:36:58,372 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:36:58,372 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:36:58,372 INFO L745 eck$LassoCheckResult]: Stem: 64#$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(13, 2);call #Ultimate.allocInit(12, 3); 59#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_#t~ret5#1, main_#t~ret6#1, main_#t~ret7#1, main_#t~nondet8#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~ret11#1, main_#t~ret12#1, main_#t~post13#1, main_~i~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1, main_~t~0#1, main_~u~0#1, main_~v~0#1;havoc main_~i~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;havoc main_~t~0#1;havoc main_~u~0#1;havoc main_~v~0#1;assume { :begin_inline_f } true;f_#in~x#1 := 0.0;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(2.0, f_~x#1), 3.0); 53#f_returnLabel#1 main_#t~ret4#1 := f_#res#1;havoc f_~x#1;havoc f_#in~x#1;assume { :end_inline_f } true;main_~y~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1;assume { :begin_inline_g } true;g_#in~x#1 := 0.0;havoc g_#res#1;havoc g_~x#1;g_~x#1 := g_#in~x#1;g_#res#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(g_~x#1), 5.0); 54#g_returnLabel#1 main_#t~ret5#1 := g_#res#1;havoc g_~x#1;havoc g_#in~x#1;assume { :end_inline_g } true;main_~z~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1;assume { :begin_inline_f } true;f_#in~x#1 := 0.75;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(2.0, f_~x#1), 3.0); 55#f_returnLabel#2 main_#t~ret6#1 := f_#res#1;havoc f_~x#1;havoc f_#in~x#1;assume { :end_inline_f } true;main_~u~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1;assume { :begin_inline_g } true;g_#in~x#1 := 0.25;havoc g_#res#1;havoc g_~x#1;g_~x#1 := g_#in~x#1;g_#res#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(g_~x#1), 5.0); 56#g_returnLabel#2 main_#t~ret7#1 := g_#res#1;havoc g_~x#1;havoc g_#in~x#1;assume { :end_inline_g } true;main_~v~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_~i~0#1 := 1; 57#L36-3 [2024-10-15 00:36:58,373 INFO L747 eck$LassoCheckResult]: Loop: 57#L36-3 assume !!(main_~i~0#1 <= 100000);havoc main_#t~nondet8#1;main_~x~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(main_~x~0#1, 0.0) && ~someBinaryFLOATComparisonOperation(main_~x~0#1, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(main_~i~0#1), 100000.0)) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 58#L13 assume !(0 == assume_abort_if_not_~cond#1); 62#L12 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_f } true;f_#in~x#1 := main_~x~0#1;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(2.0, f_~x#1), 3.0); 63#f_returnLabel#3 main_#t~ret9#1 := f_#res#1;havoc f_~x#1;havoc f_#in~x#1;assume { :end_inline_f } true;main_~y~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_g } true;g_#in~x#1 := main_~x~0#1;havoc g_#res#1;havoc g_~x#1;g_~x#1 := g_#in~x#1;g_#res#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(g_~x#1), 5.0); 51#g_returnLabel#3 main_#t~ret10#1 := g_#res#1;havoc g_~x#1;havoc g_#in~x#1;assume { :end_inline_g } true;main_~z~0#1 := main_#t~ret10#1;havoc main_#t~ret10#1;assume { :begin_inline_f } true;f_#in~x#1 := main_~v~0#1;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(2.0, f_~x#1), 3.0); 52#f_returnLabel#4 main_#t~ret11#1 := f_#res#1;havoc f_~x#1;havoc f_#in~x#1;assume { :end_inline_f } true;main_~u~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;assume { :begin_inline_g } true;g_#in~x#1 := main_~u~0#1;havoc g_#res#1;havoc g_~x#1;g_~x#1 := g_#in~x#1;g_#res#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(g_~x#1), 5.0); 60#g_returnLabel#4 main_#t~ret12#1 := g_#res#1;havoc g_~x#1;havoc g_#in~x#1;assume { :end_inline_g } true;main_~v~0#1 := ~someBinaryArithmeticFLOAToperation(main_#t~ret12#1, 2.0);havoc main_#t~ret12#1; 61#L36-2 main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 57#L36-3 [2024-10-15 00:36:58,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:36:58,374 INFO L85 PathProgramCache]: Analyzing trace with hash 889475911, now seen corresponding path program 2 times [2024-10-15 00:36:58,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:36:58,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313422501] [2024-10-15 00:36:58,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:36:58,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:36:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:36:58,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:36:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:36:58,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:36:58,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:36:58,435 INFO L85 PathProgramCache]: Analyzing trace with hash -822332692, now seen corresponding path program 1 times [2024-10-15 00:36:58,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:36:58,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110850014] [2024-10-15 00:36:58,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:36:58,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:36:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:36:58,460 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:36:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:36:58,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:36:58,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:36:58,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2058608690, now seen corresponding path program 1 times [2024-10-15 00:36:58,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:36:58,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653679971] [2024-10-15 00:36:58,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:36:58,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:36:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:36:58,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:36:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:36:58,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:36:58,714 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:36:58,718 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:36:58,718 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:36:58,718 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:36:58,718 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:36:58,718 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:36:58,718 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:36:58,718 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:36:58,719 INFO L132 ssoRankerPreferences]: Filename of dumped script: zonotope_3.c_Iteration2_Loop [2024-10-15 00:36:58,719 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:36:58,719 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:36:58,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,886 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:36:58,886 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:36:58,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:36:58,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:36:58,890 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-10-15 00:36:58,892 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-10-15 00:36:58,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:36:58,893 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:36:58,921 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-10-15 00:36:58,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:36:58,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:36:58,923 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-10-15 00:36:58,924 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-10-15 00:36:58,926 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:36:58,926 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:36:58,965 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:36:58,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-15 00:36:58,971 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:36:58,971 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:36:58,971 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:36:58,971 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:36:58,971 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:36:58,971 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:36:58,971 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:36:58,971 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:36:58,971 INFO L132 ssoRankerPreferences]: Filename of dumped script: zonotope_3.c_Iteration2_Loop [2024-10-15 00:36:58,971 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:36:58,971 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:36:58,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:58,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:59,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:59,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:59,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:59,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:59,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:59,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:59,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:59,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:59,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:59,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:59,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:36:59,102 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:36:59,107 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:36:59,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:36:59,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:36:59,113 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-10-15 00:36:59,117 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-10-15 00:36:59,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:36:59,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:36:59,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:36:59,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:36:59,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:36:59,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:36:59,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:36:59,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:36:59,135 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:36:59,140 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:36:59,140 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:36:59,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:36:59,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:36:59,143 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-10-15 00:36:59,145 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-10-15 00:36:59,146 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:36:59,147 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:36:59,147 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:36:59,148 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 200001 Supporting invariants [] [2024-10-15 00:36:59,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-15 00:36:59,162 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:36:59,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:36:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:36:59,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:36:59,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:36:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:36:59,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:36:59,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:36:59,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:36:59,269 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:36:59,270 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 14 transitions. cyclomatic complexity: 1 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:36:59,301 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 14 transitions. cyclomatic complexity: 1. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 22 states and 23 transitions. Complement of second has 4 states. [2024-10-15 00:36:59,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:36:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:36:59,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-10-15 00:36:59,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 6 letters. Loop has 8 letters. [2024-10-15 00:36:59,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:36:59,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 14 letters. Loop has 8 letters. [2024-10-15 00:36:59,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:36:59,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 6 letters. Loop has 16 letters. [2024-10-15 00:36:59,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:36:59,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2024-10-15 00:36:59,306 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:36:59,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2024-10-15 00:36:59,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 00:36:59,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 00:36:59,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 00:36:59,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:36:59,306 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:36:59,306 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:36:59,307 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:36:59,307 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:36:59,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-15 00:36:59,307 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:36:59,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-15 00:36:59,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 12:36:59 BoogieIcfgContainer [2024-10-15 00:36:59,313 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 00:36:59,313 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 00:36:59,313 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 00:36:59,314 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 00:36:59,314 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:36:58" (3/4) ... [2024-10-15 00:36:59,315 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-15 00:36:59,316 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 00:36:59,317 INFO L158 Benchmark]: Toolchain (without parser) took 1930.26ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 94.5MB in the beginning and 187.3MB in the end (delta: -92.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:36:59,317 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 167.8MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:36:59,317 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.95ms. Allocated memory is still 167.8MB. Free memory was 94.4MB in the beginning and 82.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-15 00:36:59,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.71ms. Allocated memory is still 167.8MB. Free memory was 82.9MB in the beginning and 135.9MB in the end (delta: -53.0MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-10-15 00:36:59,318 INFO L158 Benchmark]: Boogie Preprocessor took 27.01ms. Allocated memory is still 167.8MB. Free memory was 135.9MB in the beginning and 133.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:36:59,318 INFO L158 Benchmark]: RCFGBuilder took 353.74ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 133.9MB in the beginning and 220.2MB in the end (delta: -86.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 00:36:59,319 INFO L158 Benchmark]: BuchiAutomizer took 1291.61ms. Allocated memory is still 260.0MB. Free memory was 220.2MB in the beginning and 188.4MB in the end (delta: 31.8MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-10-15 00:36:59,319 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 260.0MB. Free memory was 188.4MB in the beginning and 187.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:36:59,321 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 119.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.95ms. Allocated memory is still 167.8MB. Free memory was 94.4MB in the beginning and 82.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.71ms. Allocated memory is still 167.8MB. Free memory was 82.9MB in the beginning and 135.9MB in the end (delta: -53.0MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.01ms. Allocated memory is still 167.8MB. Free memory was 135.9MB in the beginning and 133.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 353.74ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 133.9MB in the beginning and 220.2MB in the end (delta: -86.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 1291.61ms. Allocated memory is still 260.0MB. Free memory was 220.2MB in the beginning and 188.4MB in the end (delta: 31.8MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 260.0MB. Free memory was 188.4MB in the beginning and 187.3MB 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) + 200001) and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 33 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 39ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-15 00:36:59,339 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-10-15 00:36:59,545 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