./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/float-benchs/filter2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/float-benchs/filter2.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 e42e84729022b725ebcfce66d0ece68757a1a9b385230356b4d45a24fc6b4ef2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:40:13,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:40:13,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:40:13,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:40:13,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:40:13,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:40:13,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:40:13,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:40:13,529 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:40:13,529 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:40:13,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:40:13,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:40:13,530 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:40:13,533 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:40:13,533 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:40:13,534 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:40:13,534 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:40:13,538 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:40:13,539 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:40:13,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:40:13,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:40:13,540 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:40:13,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:40:13,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:40:13,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:40:13,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:40:13,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:40:13,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:40:13,542 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:40:13,542 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:40:13,542 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:40:13,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:40:13,543 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:40:13,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:40:13,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:40:13,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:40:13,544 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:40:13,544 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:40:13,545 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:40:13,545 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 -> e42e84729022b725ebcfce66d0ece68757a1a9b385230356b4d45a24fc6b4ef2 [2024-11-19 14:40:13,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:40:13,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:40:13,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:40:13,849 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:40:13,850 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:40:13,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter2.c [2024-11-19 14:40:15,334 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:40:15,507 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:40:15,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter2.c [2024-11-19 14:40:15,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af636e15f/29727deb6f8540f0b7aa2ef861c3ddab/FLAG2be924bad [2024-11-19 14:40:15,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af636e15f/29727deb6f8540f0b7aa2ef861c3ddab [2024-11-19 14:40:15,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:40:15,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:40:15,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:40:15,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:40:15,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:40:15,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:40:15" (1/1) ... [2024-11-19 14:40:15,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b4af4a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:15, skipping insertion in model container [2024-11-19 14:40:15,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:40:15" (1/1) ... [2024-11-19 14:40:15,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:40:16,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:40:16,149 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:40:16,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:40:16,209 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:40:16,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:16 WrapperNode [2024-11-19 14:40:16,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:40:16,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:40:16,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:40:16,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:40:16,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:16" (1/1) ... [2024-11-19 14:40:16,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:16" (1/1) ... [2024-11-19 14:40:16,240 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 62 [2024-11-19 14:40:16,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:40:16,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:40:16,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:40:16,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:40:16,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:16" (1/1) ... [2024-11-19 14:40:16,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:16" (1/1) ... [2024-11-19 14:40:16,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:16" (1/1) ... [2024-11-19 14:40:16,272 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 14:40:16,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:16" (1/1) ... [2024-11-19 14:40:16,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:16" (1/1) ... [2024-11-19 14:40:16,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:16" (1/1) ... [2024-11-19 14:40:16,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:16" (1/1) ... [2024-11-19 14:40:16,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:16" (1/1) ... [2024-11-19 14:40:16,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:16" (1/1) ... [2024-11-19 14:40:16,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:40:16,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:40:16,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:40:16,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:40:16,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:16" (1/1) ... [2024-11-19 14:40:16,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:40:16,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:40:16,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:40:16,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:40:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 14:40:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 14:40:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:40:16,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:40:16,429 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:40:16,431 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:40:16,555 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-19 14:40:16,555 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:40:16,566 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:40:16,566 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 14:40:16,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:40:16 BoogieIcfgContainer [2024-11-19 14:40:16,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:40:16,567 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:40:16,567 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:40:16,570 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:40:16,571 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:40:16,571 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:40:15" (1/3) ... [2024-11-19 14:40:16,572 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ffcff31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:40:16, skipping insertion in model container [2024-11-19 14:40:16,572 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:40:16,572 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:40:16" (2/3) ... [2024-11-19 14:40:16,572 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ffcff31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:40:16, skipping insertion in model container [2024-11-19 14:40:16,572 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:40:16,572 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:40:16" (3/3) ... [2024-11-19 14:40:16,574 INFO L332 chiAutomizerObserver]: Analyzing ICFG filter2.c [2024-11-19 14:40:16,620 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:40:16,621 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:40:16,621 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:40:16,621 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:40:16,621 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:40:16,621 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:40:16,621 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:40:16,622 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:40:16,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:40:16,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:40:16,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:40:16,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:40:16,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:40:16,644 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:40:16,644 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:40:16,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:40:16,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:40:16,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:40:16,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:40:16,646 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:40:16,646 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:40:16,652 INFO L745 eck$LassoCheckResult]: Stem: 14#$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(10, 2);call #Ultimate.allocInit(12, 3); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post7#1, main_~E~0#1, main_~E0~0#1, main_~E1~0#1, main_~S0~0#1, main_~S1~0#1, main_~S~0#1, main_~i~0#1;havoc main_~E~0#1;havoc main_~E0~0#1;havoc main_~E1~0#1;havoc main_~S0~0#1;havoc main_~S1~0#1;havoc main_~S~0#1;havoc main_~i~0#1;havoc main_#t~nondet4#1;main_~E~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~E0~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~E~0#1, 0.0) && ~someBinaryDOUBLEComparisonOperation(main_~E~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; 3#L15true assume !(0 == assume_abort_if_not_~cond#1); 8#L14true havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~E0~0#1, 0.0) && ~someBinaryDOUBLEComparisonOperation(main_~E0~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; 10#L15-2true assume !(0 == assume_abort_if_not_~cond#1); 17#L14-1true havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;main_~S0~0#1 := ~convertINTToDOUBLE(0);main_~S~0#1 := ~convertINTToDOUBLE(0);main_~i~0#1 := 0; 15#L33-3true [2024-11-19 14:40:16,652 INFO L747 eck$LassoCheckResult]: Loop: 15#L33-3true assume !!(main_~i~0#1 <= 1000000);main_~E1~0#1 := main_~E0~0#1;main_~E0~0#1 := main_~E~0#1;havoc main_#t~nondet6#1;main_~E~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~E~0#1, 0.0) && ~someBinaryDOUBLEComparisonOperation(main_~E~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; 11#L15-4true assume 0 == assume_abort_if_not_~cond#1;assume false; 18#L14-2true havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;main_~S1~0#1 := main_~S0~0#1;main_~S0~0#1 := main_~S~0#1;main_~S~0#1 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(0.7, main_~E~0#1), ~someBinaryArithmeticDOUBLEoperation(main_~E0~0#1, 1.3)), ~someBinaryArithmeticDOUBLEoperation(main_~E1~0#1, 1.1)), ~someBinaryArithmeticDOUBLEoperation(main_~S0~0#1, 1.4)), ~someBinaryArithmeticDOUBLEoperation(main_~S1~0#1, 0.7));assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~S~0#1, ~someUnaryDOUBLEoperation(4.0)) && ~someBinaryDOUBLEComparisonOperation(main_~S~0#1, 4.0) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12#L17true assume !(0 == __VERIFIER_assert_~cond#1); 7#L17-3true havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5#L33-2true main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 15#L33-3true [2024-11-19 14:40:16,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:40:16,658 INFO L85 PathProgramCache]: Analyzing trace with hash 889568359, now seen corresponding path program 1 times [2024-11-19 14:40:16,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:40:16,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191010833] [2024-11-19 14:40:16,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:40:16,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:40:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:40:16,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:40:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:40:16,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:40:16,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:40:16,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1600501711, now seen corresponding path program 1 times [2024-11-19 14:40:16,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:40:16,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633776956] [2024-11-19 14:40:16,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:40:16,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:40:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:40:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:40:16,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:40:16,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633776956] [2024-11-19 14:40:16,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633776956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:40:16,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:40:16,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:40:16,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656403345] [2024-11-19 14:40:16,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:40:16,906 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:40:16,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:40:16,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 14:40:16,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 14:40:16,942 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:40:16,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:40:16,950 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-19 14:40:16,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 17 transitions. [2024-11-19 14:40:16,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-19 14:40:16,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 12 transitions. [2024-11-19 14:40:16,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-19 14:40:16,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:40:16,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 12 transitions. [2024-11-19 14:40:16,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:40:16,962 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-19 14:40:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 12 transitions. [2024-11-19 14:40:16,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-19 14:40:16,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:40:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-19 14:40:16,989 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-19 14:40:16,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 14:40:16,995 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-19 14:40:16,996 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:40:16,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 12 transitions. [2024-11-19 14:40:16,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-19 14:40:16,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:40:16,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:40:16,997 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:40:16,997 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:40:16,997 INFO L745 eck$LassoCheckResult]: Stem: 47#$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(10, 2);call #Ultimate.allocInit(12, 3); 48#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post7#1, main_~E~0#1, main_~E0~0#1, main_~E1~0#1, main_~S0~0#1, main_~S1~0#1, main_~S~0#1, main_~i~0#1;havoc main_~E~0#1;havoc main_~E0~0#1;havoc main_~E1~0#1;havoc main_~S0~0#1;havoc main_~S1~0#1;havoc main_~S~0#1;havoc main_~i~0#1;havoc main_#t~nondet4#1;main_~E~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~E0~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~E~0#1, 0.0) && ~someBinaryDOUBLEComparisonOperation(main_~E~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; 49#L15 assume !(0 == assume_abort_if_not_~cond#1); 50#L14 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~E0~0#1, 0.0) && ~someBinaryDOUBLEComparisonOperation(main_~E0~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; 53#L15-2 assume !(0 == assume_abort_if_not_~cond#1); 54#L14-1 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;main_~S0~0#1 := ~convertINTToDOUBLE(0);main_~S~0#1 := ~convertINTToDOUBLE(0);main_~i~0#1 := 0; 52#L33-3 [2024-11-19 14:40:16,998 INFO L747 eck$LassoCheckResult]: Loop: 52#L33-3 assume !!(main_~i~0#1 <= 1000000);main_~E1~0#1 := main_~E0~0#1;main_~E0~0#1 := main_~E~0#1;havoc main_#t~nondet6#1;main_~E~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~E~0#1, 0.0) && ~someBinaryDOUBLEComparisonOperation(main_~E~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; 43#L15-4 assume !(0 == assume_abort_if_not_~cond#1); 44#L14-2 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;main_~S1~0#1 := main_~S0~0#1;main_~S0~0#1 := main_~S~0#1;main_~S~0#1 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(0.7, main_~E~0#1), ~someBinaryArithmeticDOUBLEoperation(main_~E0~0#1, 1.3)), ~someBinaryArithmeticDOUBLEoperation(main_~E1~0#1, 1.1)), ~someBinaryArithmeticDOUBLEoperation(main_~S0~0#1, 1.4)), ~someBinaryArithmeticDOUBLEoperation(main_~S1~0#1, 0.7));assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~S~0#1, ~someUnaryDOUBLEoperation(4.0)) && ~someBinaryDOUBLEComparisonOperation(main_~S~0#1, 4.0) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 45#L17 assume !(0 == __VERIFIER_assert_~cond#1); 46#L17-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 51#L33-2 main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 52#L33-3 [2024-11-19 14:40:17,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:40:17,001 INFO L85 PathProgramCache]: Analyzing trace with hash 889568359, now seen corresponding path program 2 times [2024-11-19 14:40:17,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:40:17,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501563877] [2024-11-19 14:40:17,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:40:17,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:40:17,026 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:40:17,028 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:40:17,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:40:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:40:17,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:40:17,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:40:17,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1602348753, now seen corresponding path program 1 times [2024-11-19 14:40:17,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:40:17,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974247050] [2024-11-19 14:40:17,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:40:17,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:40:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:40:17,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:40:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:40:17,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:40:17,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:40:17,096 INFO L85 PathProgramCache]: Analyzing trace with hash 604389047, now seen corresponding path program 1 times [2024-11-19 14:40:17,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:40:17,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353127446] [2024-11-19 14:40:17,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:40:17,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:40:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:40:17,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:40:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:40:17,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:40:17,326 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:40:17,327 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:40:17,327 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:40:17,327 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:40:17,327 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:40:17,327 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:40:17,327 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:40:17,328 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:40:17,328 INFO L132 ssoRankerPreferences]: Filename of dumped script: filter2.c_Iteration2_Loop [2024-11-19 14:40:17,328 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:40:17,328 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:40:17,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:17,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:17,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:17,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:17,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:17,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:17,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:17,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:17,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:17,462 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:40:17,463 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:40:17,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:40:17,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:40:17,467 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:40:17,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-19 14:40:17,482 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:40:17,482 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:40:17,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-19 14:40:17,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:40:17,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:40:17,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:40:17,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-19 14:40:17,522 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:40:17,523 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:40:17,560 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:40:17,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-19 14:40:17,566 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:40:17,566 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:40:17,566 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:40:17,567 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:40:17,567 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:40:17,567 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:40:17,567 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:40:17,567 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:40:17,567 INFO L132 ssoRankerPreferences]: Filename of dumped script: filter2.c_Iteration2_Loop [2024-11-19 14:40:17,567 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:40:17,567 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:40:17,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:17,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:17,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:17,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:17,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:17,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:17,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:17,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:17,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:40:17,680 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:40:17,685 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:40:17,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:40:17,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:40:17,688 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:40:17,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-19 14:40:17,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:40:17,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:40:17,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:40:17,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:40:17,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:40:17,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:40:17,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:40:17,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:40:17,716 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:40:17,731 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-11-19 14:40:17,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:40:17,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:40:17,734 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:40:17,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 14:40:17,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:40:17,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:40:17,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:40:17,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:40:17,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:40:17,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:40:17,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:40:17,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:40:17,753 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:40:17,758 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:40:17,758 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:40:17,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:40:17,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:40:17,761 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:40:17,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 14:40:17,774 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:40:17,774 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:40:17,775 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:40:17,775 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 2000001 Supporting invariants [] [2024-11-19 14:40:17,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 14:40:17,801 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:40:17,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:40:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:40:17,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:40:17,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:40:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:40:17,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:40:17,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:40:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:40:17,933 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:40:17,934 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 12 transitions. cyclomatic complexity: 1 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:40:17,970 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 12 transitions. cyclomatic complexity: 1. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 19 transitions. Complement of second has 4 states. [2024-11-19 14:40:17,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:40:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:40:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2024-11-19 14:40:17,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2024-11-19 14:40:17,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:40:17,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 12 letters. Loop has 6 letters. [2024-11-19 14:40:17,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:40:17,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 12 letters. [2024-11-19 14:40:17,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:40:17,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2024-11-19 14:40:17,978 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:40:17,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2024-11-19 14:40:17,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 14:40:17,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 14:40:17,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 14:40:17,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:40:17,978 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:40:17,979 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:40:17,979 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:40:17,979 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:40:17,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-19 14:40:17,979 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:40:17,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-19 14:40:17,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:40:17 BoogieIcfgContainer [2024-11-19 14:40:17,989 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:40:17,989 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:40:17,989 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:40:17,990 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:40:17,990 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:40:16" (3/4) ... [2024-11-19 14:40:17,992 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 14:40:17,993 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:40:17,995 INFO L158 Benchmark]: Toolchain (without parser) took 2087.14ms. Allocated memory was 127.9MB in the beginning and 169.9MB in the end (delta: 41.9MB). Free memory was 74.2MB in the beginning and 117.0MB in the end (delta: -42.8MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. [2024-11-19 14:40:17,996 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 127.9MB. Free memory was 99.2MB in the beginning and 99.0MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:40:17,996 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.61ms. Allocated memory was 127.9MB in the beginning and 169.9MB in the end (delta: 41.9MB). Free memory was 73.9MB in the beginning and 139.1MB in the end (delta: -65.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 14:40:17,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.50ms. Allocated memory is still 169.9MB. Free memory was 139.1MB in the beginning and 137.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:40:17,997 INFO L158 Benchmark]: Boogie Preprocessor took 46.19ms. Allocated memory is still 169.9MB. Free memory was 137.7MB in the beginning and 135.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:40:17,997 INFO L158 Benchmark]: RCFGBuilder took 278.41ms. Allocated memory is still 169.9MB. Free memory was 135.8MB in the beginning and 125.1MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 14:40:17,998 INFO L158 Benchmark]: BuchiAutomizer took 1421.77ms. Allocated memory is still 169.9MB. Free memory was 125.1MB in the beginning and 118.1MB in the end (delta: 7.0MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-11-19 14:40:17,998 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 169.9MB. Free memory was 118.1MB in the beginning and 117.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:40:18,000 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 127.9MB. Free memory was 99.2MB in the beginning and 99.0MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.61ms. Allocated memory was 127.9MB in the beginning and 169.9MB in the end (delta: 41.9MB). Free memory was 73.9MB in the beginning and 139.1MB in the end (delta: -65.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.50ms. Allocated memory is still 169.9MB. Free memory was 139.1MB in the beginning and 137.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.19ms. Allocated memory is still 169.9MB. Free memory was 137.7MB in the beginning and 135.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 278.41ms. Allocated memory is still 169.9MB. Free memory was 135.8MB in the beginning and 125.1MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1421.77ms. Allocated memory is still 169.9MB. Free memory was 125.1MB in the beginning and 118.1MB in the end (delta: 7.0MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 169.9MB. Free memory was 118.1MB in the beginning and 117.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 2000001) and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. 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, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 27 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf100 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-19 14:40:18,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-19 14:40:18,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE