./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/mine2017-ex4.8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8be7027f 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/loop-lit/mine2017-ex4.8.i -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 ee63462f1ec886f4aa9c5663162640144e173530e57636655ca95f3d6ab0ae72 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 21:27:06,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 21:27:06,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-12 21:27:06,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 21:27:06,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 21:27:06,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 21:27:06,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 21:27:06,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 21:27:06,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 21:27:06,710 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 21:27:06,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 21:27:06,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 21:27:06,712 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 21:27:06,715 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-12 21:27:06,715 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-12 21:27:06,715 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-12 21:27:06,716 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-12 21:27:06,716 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-12 21:27:06,716 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-12 21:27:06,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 21:27:06,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-12 21:27:06,718 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 21:27:06,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 21:27:06,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 21:27:06,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 21:27:06,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-12 21:27:06,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-12 21:27:06,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-12 21:27:06,720 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 21:27:06,720 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 21:27:06,721 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 21:27:06,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 21:27:06,721 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-12 21:27:06,722 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 21:27:06,722 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 21:27:06,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 21:27:06,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 21:27:06,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 21:27:06,723 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-12 21:27:06,724 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 -> ee63462f1ec886f4aa9c5663162640144e173530e57636655ca95f3d6ab0ae72 [2024-11-12 21:27:07,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 21:27:07,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 21:27:07,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 21:27:07,050 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 21:27:07,050 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 21:27:07,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/mine2017-ex4.8.i [2024-11-12 21:27:08,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 21:27:08,746 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 21:27:08,747 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/mine2017-ex4.8.i [2024-11-12 21:27:08,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b4e7ab6/9411ff41b0444962a4ad9c819c3fc7c8/FLAG8cddbbaf2 [2024-11-12 21:27:08,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b4e7ab6/9411ff41b0444962a4ad9c819c3fc7c8 [2024-11-12 21:27:08,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 21:27:08,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 21:27:08,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 21:27:08,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 21:27:08,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 21:27:08,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:27:08" (1/1) ... [2024-11-12 21:27:08,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4daf42a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:08, skipping insertion in model container [2024-11-12 21:27:08,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:27:08" (1/1) ... [2024-11-12 21:27:08,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 21:27:08,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:27:09,005 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 21:27:09,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:27:09,034 INFO L204 MainTranslator]: Completed translation [2024-11-12 21:27:09,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:09 WrapperNode [2024-11-12 21:27:09,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 21:27:09,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 21:27:09,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 21:27:09,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 21:27:09,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:09" (1/1) ... [2024-11-12 21:27:09,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:09" (1/1) ... [2024-11-12 21:27:09,068 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 37 [2024-11-12 21:27:09,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 21:27:09,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 21:27:09,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 21:27:09,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 21:27:09,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:09" (1/1) ... [2024-11-12 21:27:09,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:09" (1/1) ... [2024-11-12 21:27:09,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:09" (1/1) ... [2024-11-12 21:27:09,088 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-12 21:27:09,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:09" (1/1) ... [2024-11-12 21:27:09,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:09" (1/1) ... [2024-11-12 21:27:09,091 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:09" (1/1) ... [2024-11-12 21:27:09,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:09" (1/1) ... [2024-11-12 21:27:09,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:09" (1/1) ... [2024-11-12 21:27:09,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:09" (1/1) ... [2024-11-12 21:27:09,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 21:27:09,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 21:27:09,099 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 21:27:09,099 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 21:27:09,100 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:09" (1/1) ... [2024-11-12 21:27:09,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:09,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:09,128 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-12 21:27:09,131 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-12 21:27:09,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 21:27:09,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 21:27:09,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 21:27:09,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 21:27:09,222 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 21:27:09,224 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 21:27:09,343 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 21:27:09,344 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 21:27:09,359 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 21:27:09,359 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 21:27:09,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:27:09 BoogieIcfgContainer [2024-11-12 21:27:09,360 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 21:27:09,361 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-12 21:27:09,361 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-12 21:27:09,365 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-12 21:27:09,366 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:27:09,368 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 09:27:08" (1/3) ... [2024-11-12 21:27:09,369 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31e0ea2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:27:09, skipping insertion in model container [2024-11-12 21:27:09,370 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:27:09,370 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:09" (2/3) ... [2024-11-12 21:27:09,371 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31e0ea2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:27:09, skipping insertion in model container [2024-11-12 21:27:09,371 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:27:09,371 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:27:09" (3/3) ... [2024-11-12 21:27:09,372 INFO L332 chiAutomizerObserver]: Analyzing ICFG mine2017-ex4.8.i [2024-11-12 21:27:09,438 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2024-11-12 21:27:09,439 INFO L302 stractBuchiCegarLoop]: Hoare is None [2024-11-12 21:27:09,439 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-12 21:27:09,439 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-12 21:27:09,439 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-12 21:27:09,440 INFO L306 stractBuchiCegarLoop]: Difference is false [2024-11-12 21:27:09,440 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-12 21:27:09,441 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-12 21:27:09,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:27:09,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-12 21:27:09,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:09,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:09,469 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:27:09,469 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:27:09,469 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-12 21:27:09,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:27:09,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-12 21:27:09,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:09,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:09,475 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:27:09,475 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:27:09,482 INFO L747 eck$LassoCheckResult]: Stem: "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(22, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~v~0#1;main_~v~0#1 := 0;" [2024-11-12 21:27:09,482 INFO L749 eck$LassoCheckResult]: Loop: "havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1;" "assume !!(0 == (if main_#t~nondet1#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet1#1 % 256 % 4294967296 else main_#t~nondet1#1 % 256 % 4294967296 - 4294967296));havoc main_#t~nondet1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~v~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~v~0#1 <= 1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !(0 == main_~v~0#1);" [2024-11-12 21:27:09,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:09,492 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-12 21:27:09,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:09,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975237387] [2024-11-12 21:27:09,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:09,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:09,598 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:09,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:09,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:09,629 INFO L85 PathProgramCache]: Analyzing trace with hash -266161209, now seen corresponding path program 1 times [2024-11-12 21:27:09,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:09,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922006778] [2024-11-12 21:27:09,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:09,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:09,662 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:09,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:09,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:09,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1280135621, now seen corresponding path program 1 times [2024-11-12 21:27:09,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:09,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055977677] [2024-11-12 21:27:09,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:09,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:09,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:27:09,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055977677] [2024-11-12 21:27:09,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055977677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:27:09,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581863926] [2024-11-12 21:27:09,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:09,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:27:09,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:09,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:27:09,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 21:27:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:09,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 21:27:09,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:09,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:27:09,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581863926] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:27:09,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:27:09,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2024-11-12 21:27:09,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774775370] [2024-11-12 21:27:09,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:27:10,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:27:10,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 21:27:10,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 21:27:10,136 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-12 21:27:10,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:27:10,167 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2024-11-12 21:27:10,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 32 transitions. [2024-11-12 21:27:10,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-12 21:27:10,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 16 states and 17 transitions. [2024-11-12 21:27:10,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-12 21:27:10,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-12 21:27:10,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2024-11-12 21:27:10,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:27:10,180 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-12 21:27:10,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2024-11-12 21:27:10,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-12 21:27:10,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 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-12 21:27:10,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-12 21:27:10,207 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-12 21:27:10,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 21:27:10,213 INFO L426 stractBuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-12 21:27:10,215 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-12 21:27:10,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 17 transitions. [2024-11-12 21:27:10,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-12 21:27:10,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:10,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:10,216 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:27:10,216 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:27:10,217 INFO L747 eck$LassoCheckResult]: Stem: "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(22, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~v~0#1;main_~v~0#1 := 0;" "havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1;" "assume !!(0 == (if main_#t~nondet1#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet1#1 % 256 % 4294967296 else main_#t~nondet1#1 % 256 % 4294967296 - 4294967296));havoc main_#t~nondet1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~v~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~v~0#1 <= 1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume 0 == main_~v~0#1;main_~v~0#1 := 1;" [2024-11-12 21:27:10,217 INFO L749 eck$LassoCheckResult]: Loop: "havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1;" "assume !!(0 == (if main_#t~nondet1#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet1#1 % 256 % 4294967296 else main_#t~nondet1#1 % 256 % 4294967296 - 4294967296));havoc main_#t~nondet1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~v~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~v~0#1 <= 1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !(0 == main_~v~0#1);" [2024-11-12 21:27:10,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:10,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1280135619, now seen corresponding path program 1 times [2024-11-12 21:27:10,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:10,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451341896] [2024-11-12 21:27:10,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:10,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:10,243 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:10,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:10,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:10,262 INFO L85 PathProgramCache]: Analyzing trace with hash -266161209, now seen corresponding path program 2 times [2024-11-12 21:27:10,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:10,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36581642] [2024-11-12 21:27:10,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:10,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:10,282 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:10,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:10,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:10,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1693695035, now seen corresponding path program 1 times [2024-11-12 21:27:10,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:10,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411921721] [2024-11-12 21:27:10,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:10,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:10,322 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:10,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:10,665 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:10,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.11 09:27:10 BoogieIcfgContainer [2024-11-12 21:27:10,707 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-12 21:27:10,708 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 21:27:10,708 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 21:27:10,708 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 21:27:10,709 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:27:09" (3/4) ... [2024-11-12 21:27:10,711 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-12 21:27:10,751 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 21:27:10,752 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 21:27:10,752 INFO L158 Benchmark]: Toolchain (without parser) took 1965.31ms. Allocated memory is still 165.7MB. Free memory was 111.0MB in the beginning and 90.5MB in the end (delta: 20.4MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-11-12 21:27:10,753 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 165.7MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:27:10,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.18ms. Allocated memory is still 165.7MB. Free memory was 110.5MB in the beginning and 98.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 21:27:10,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.09ms. Allocated memory is still 165.7MB. Free memory was 98.8MB in the beginning and 97.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 21:27:10,754 INFO L158 Benchmark]: Boogie Preprocessor took 28.06ms. Allocated memory is still 165.7MB. Free memory was 97.3MB in the beginning and 95.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:27:10,754 INFO L158 Benchmark]: RCFGBuilder took 261.79ms. Allocated memory is still 165.7MB. Free memory was 95.7MB in the beginning and 85.3MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 21:27:10,754 INFO L158 Benchmark]: BuchiAutomizer took 1346.33ms. Allocated memory is still 165.7MB. Free memory was 85.3MB in the beginning and 91.8MB in the end (delta: -6.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:27:10,755 INFO L158 Benchmark]: Witness Printer took 43.73ms. Allocated memory is still 165.7MB. Free memory was 91.8MB in the beginning and 90.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:27:10,756 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.21ms. Allocated memory is still 165.7MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.18ms. Allocated memory is still 165.7MB. Free memory was 110.5MB in the beginning and 98.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.09ms. Allocated memory is still 165.7MB. Free memory was 98.8MB in the beginning and 97.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.06ms. Allocated memory is still 165.7MB. Free memory was 97.3MB in the beginning and 95.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 261.79ms. Allocated memory is still 165.7MB. Free memory was 95.7MB in the beginning and 85.3MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1346.33ms. Allocated memory is still 165.7MB. Free memory was 85.3MB in the beginning and 91.8MB in the end (delta: -6.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 43.73ms. Allocated memory is still 165.7MB. Free memory was 91.8MB in the beginning and 90.5MB in the end (delta: 1.3MB). 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 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.2s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 15 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L16] int v = 0; VAL [v=0] [L17] COND TRUE __VERIFIER_nondet_bool() == 0 [L18] CALL __VERIFIER_assert(0 <= v) [L13] COND FALSE !(!(cond)) [L18] RET __VERIFIER_assert(0 <= v) [L19] CALL __VERIFIER_assert(v <= 1) [L13] COND FALSE !(!(cond)) [L19] RET __VERIFIER_assert(v <= 1) [L20] COND TRUE v == 0 [L21] v = 1 VAL [v=1] Loop: [L17] COND TRUE __VERIFIER_nondet_bool() == 0 [L18] CALL __VERIFIER_assert(0 <= v) [L13] COND FALSE !(!(cond)) [L18] RET __VERIFIER_assert(0 <= v) [L19] CALL __VERIFIER_assert(v <= 1) [L13] COND FALSE !(!(cond)) [L19] RET __VERIFIER_assert(v <= 1) [L20] COND FALSE !(v == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L16] int v = 0; VAL [v=0] [L17] COND TRUE __VERIFIER_nondet_bool() == 0 [L18] CALL __VERIFIER_assert(0 <= v) [L13] COND FALSE !(!(cond)) [L18] RET __VERIFIER_assert(0 <= v) [L19] CALL __VERIFIER_assert(v <= 1) [L13] COND FALSE !(!(cond)) [L19] RET __VERIFIER_assert(v <= 1) [L20] COND TRUE v == 0 [L21] v = 1 VAL [v=1] Loop: [L17] COND TRUE __VERIFIER_nondet_bool() == 0 [L18] CALL __VERIFIER_assert(0 <= v) [L13] COND FALSE !(!(cond)) [L18] RET __VERIFIER_assert(0 <= v) [L19] CALL __VERIFIER_assert(v <= 1) [L13] COND FALSE !(!(cond)) [L19] RET __VERIFIER_assert(v <= 1) [L20] COND FALSE !(v == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-12 21:27:10,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 21:27:10,984 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)