./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 0301294b5b50ee43814efe2bd49b834b2b8f0455334e679e746f10ee76ed616a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:24:12,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:24:12,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:24:12,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:24:12,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:24:12,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:24:12,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:24:12,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:24:12,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:24:12,584 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:24:12,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:24:12,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:24:12,586 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:24:12,586 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:24:12,586 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:24:12,587 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:24:12,587 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:24:12,587 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:24:12,587 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:24:12,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:24:12,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:24:12,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:24:12,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:24:12,592 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:24:12,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:24:12,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:24:12,593 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:24:12,593 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:24:12,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:24:12,594 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:24:12,594 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:24:12,594 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:24:12,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:24:12,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:24:12,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:24:12,597 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:24:12,598 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0301294b5b50ee43814efe2bd49b834b2b8f0455334e679e746f10ee76ed616a [2024-11-09 15:24:12,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:24:12,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:24:12,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:24:12,883 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:24:12,884 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:24:12,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i [2024-11-09 15:24:14,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:24:14,578 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:24:14,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i [2024-11-09 15:24:14,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ff0c155f/3f319ce8d23147a1a45c2e9551e4ce62/FLAGb0d6cd364 [2024-11-09 15:24:14,611 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ff0c155f/3f319ce8d23147a1a45c2e9551e4ce62 [2024-11-09 15:24:14,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:24:14,615 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:24:14,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:24:14,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:24:14,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:24:14,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:24:14" (1/1) ... [2024-11-09 15:24:14,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a1a5191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:14, skipping insertion in model container [2024-11-09 15:24:14,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:24:14" (1/1) ... [2024-11-09 15:24:14,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:24:15,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:24:15,035 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:24:15,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:24:15,092 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:24:15,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:15 WrapperNode [2024-11-09 15:24:15,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:24:15,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:24:15,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:24:15,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:24:15,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:15" (1/1) ... [2024-11-09 15:24:15,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:15" (1/1) ... [2024-11-09 15:24:15,133 INFO L138 Inliner]: procedures = 110, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2024-11-09 15:24:15,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:24:15,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:24:15,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:24:15,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:24:15,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:15" (1/1) ... [2024-11-09 15:24:15,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:15" (1/1) ... [2024-11-09 15:24:15,146 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:15" (1/1) ... [2024-11-09 15:24:15,160 INFO L175 MemorySlicer]: Split 11 memory accesses to 1 slices as follows [11]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 5 writes are split as follows [5]. [2024-11-09 15:24:15,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:15" (1/1) ... [2024-11-09 15:24:15,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:15" (1/1) ... [2024-11-09 15:24:15,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:15" (1/1) ... [2024-11-09 15:24:15,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:15" (1/1) ... [2024-11-09 15:24:15,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:15" (1/1) ... [2024-11-09 15:24:15,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:15" (1/1) ... [2024-11-09 15:24:15,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:24:15,176 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:24:15,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:24:15,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:24:15,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:15" (1/1) ... [2024-11-09 15:24:15,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:15,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:15,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:15,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:24:15,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:24:15,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:24:15,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 15:24:15,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:24:15,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:24:15,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:24:15,398 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:24:15,400 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:24:15,530 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-09 15:24:15,530 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:24:15,542 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:24:15,542 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 15:24:15,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:24:15 BoogieIcfgContainer [2024-11-09 15:24:15,545 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:24:15,546 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:24:15,547 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:24:15,550 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:24:15,551 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:24:15,551 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:24:14" (1/3) ... [2024-11-09 15:24:15,552 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e7c1813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:24:15, skipping insertion in model container [2024-11-09 15:24:15,552 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:24:15,552 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:15" (2/3) ... [2024-11-09 15:24:15,553 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e7c1813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:24:15, skipping insertion in model container [2024-11-09 15:24:15,553 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:24:15,554 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:24:15" (3/3) ... [2024-11-09 15:24:15,555 INFO L332 chiAutomizerObserver]: Analyzing ICFG Velroyen-alloca.i [2024-11-09 15:24:15,615 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:24:15,615 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:24:15,616 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:24:15,616 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:24:15,616 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:24:15,616 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:24:15,616 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:24:15,616 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:24:15,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 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-09 15:24:15,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-09 15:24:15,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:24:15,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:24:15,645 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:24:15,645 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:24:15,646 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:24:15,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 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-09 15:24:15,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-09 15:24:15,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:24:15,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:24:15,648 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:24:15,648 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:24:15,654 INFO L745 eck$LassoCheckResult]: Stem: 8#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~nondet3#1;call write~int#0(main_#t~nondet3#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet3#1; 5#L552-3true [2024-11-09 15:24:15,655 INFO L747 eck$LassoCheckResult]: Loop: 5#L552-3true call main_#t~mem4#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 9#L551-1true assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1; 12#L552true assume !main_#t~short7#1; 2#L552-2true assume !main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call write~int#0(0, main_~x~0#1.base, main_~x~0#1.offset, 4); 5#L552-3true [2024-11-09 15:24:15,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:15,661 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:24:15,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:15,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811877816] [2024-11-09 15:24:15,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:15,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:15,777 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:15,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:15,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:15,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1144151, now seen corresponding path program 1 times [2024-11-09 15:24:15,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:15,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090958631] [2024-11-09 15:24:15,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:15,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:15,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:15,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:15,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:15,833 INFO L85 PathProgramCache]: Analyzing trace with hash 889571353, now seen corresponding path program 1 times [2024-11-09 15:24:15,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:15,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557120082] [2024-11-09 15:24:15,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:15,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:15,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:15,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:16,221 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:24:16,221 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:24:16,222 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:24:16,222 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:24:16,222 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:24:16,222 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:16,222 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:24:16,223 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:24:16,223 INFO L132 ssoRankerPreferences]: Filename of dumped script: Velroyen-alloca.i_Iteration1_Lasso [2024-11-09 15:24:16,223 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:24:16,224 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:24:16,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:16,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:16,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:16,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:16,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:16,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:16,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:16,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:16,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:16,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:16,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:16,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:16,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:16,616 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:24:16,620 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:24:16,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:16,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:16,624 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:16,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-09 15:24:16,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:16,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:16,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:16,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:16,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:16,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:24:16,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:24:16,658 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:16,670 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-09 15:24:16,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:16,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:16,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:16,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-09 15:24:16,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:16,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:16,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:16,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:16,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:16,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:24:16,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:24:16,696 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:16,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-09 15:24:16,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:16,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:16,714 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:16,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-09 15:24:16,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:16,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:16,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:16,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:16,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:16,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:24:16,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:24:16,736 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:16,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-09 15:24:16,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:16,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:16,754 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:16,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-09 15:24:16,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:16,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:16,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:16,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:16,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:16,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:24:16,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:24:16,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:16,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-09 15:24:16,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:16,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:16,805 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-09 15:24:16,807 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-09 15:24:16,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:16,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:16,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:16,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:16,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:16,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:16,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:16,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:16,829 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:24:16,836 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-09 15:24:16,837 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:24:16,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:16,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:16,845 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:16,847 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:24:16,847 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:24:16,847 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:24:16,847 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_1 Supporting invariants [] [2024-11-09 15:24:16,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-09 15:24:16,860 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-09 15:24:16,869 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-11-09 15:24:16,876 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:24:16,877 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:24:16,877 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2024-11-09 15:24:16,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:24:16,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:24:16,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:24:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:24:16,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 15:24:16,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:24:17,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:24:17,062 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-09 15:24:17,064 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 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) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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-09 15:24:17,155 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 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). Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Result 38 states and 53 transitions. Complement of second has 10 states. [2024-11-09 15:24:17,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 15:24:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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-09 15:24:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2024-11-09 15:24:17,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-09 15:24:17,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:24:17,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-09 15:24:17,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:24:17,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 2 letters. Loop has 8 letters. [2024-11-09 15:24:17,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:24:17,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2024-11-09 15:24:17,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-09 15:24:17,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 23 states and 35 transitions. [2024-11-09 15:24:17,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-09 15:24:17,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-09 15:24:17,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 35 transitions. [2024-11-09 15:24:17,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:24:17,173 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 35 transitions. [2024-11-09 15:24:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 35 transitions. [2024-11-09 15:24:17,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2024-11-09 15:24:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2024-11-09 15:24:17,197 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2024-11-09 15:24:17,197 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2024-11-09 15:24:17,197 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:24:17,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2024-11-09 15:24:17,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-09 15:24:17,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:24:17,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:24:17,199 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:24:17,199 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:24:17,199 INFO L745 eck$LassoCheckResult]: Stem: 124#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 125#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~nondet3#1;call write~int#0(main_#t~nondet3#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet3#1; 126#L552-3 call main_#t~mem4#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 121#L551-1 assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1; 122#L552 assume main_#t~short7#1;call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 <= 35; 128#L552-2 [2024-11-09 15:24:17,200 INFO L747 eck$LassoCheckResult]: Loop: 128#L552-2 assume !main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call write~int#0(0, main_~x~0#1.base, main_~x~0#1.offset, 4); 118#L552-3 call main_#t~mem4#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 119#L551-1 assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1; 127#L552 assume !main_#t~short7#1; 128#L552-2 [2024-11-09 15:24:17,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:17,201 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2024-11-09 15:24:17,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:17,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474559490] [2024-11-09 15:24:17,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:17,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:17,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:17,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:17,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:17,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1943531, now seen corresponding path program 2 times [2024-11-09 15:24:17,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:17,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025451540] [2024-11-09 15:24:17,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:17,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:24:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:24:17,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:24:17,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025451540] [2024-11-09 15:24:17,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025451540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:24:17,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:24:17,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:24:17,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515296638] [2024-11-09 15:24:17,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:24:17,340 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:24:17,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:24:17,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:24:17,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:24:17,344 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:17,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:24:17,371 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-11-09 15:24:17,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2024-11-09 15:24:17,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-09 15:24:17,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 27 transitions. [2024-11-09 15:24:17,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-09 15:24:17,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-09 15:24:17,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2024-11-09 15:24:17,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:24:17,374 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-11-09 15:24:17,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2024-11-09 15:24:17,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-09 15:24:17,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:17,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2024-11-09 15:24:17,376 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-11-09 15:24:17,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:24:17,377 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-11-09 15:24:17,377 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:24:17,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2024-11-09 15:24:17,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-09 15:24:17,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:24:17,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:24:17,378 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:24:17,378 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:24:17,379 INFO L745 eck$LassoCheckResult]: Stem: 179#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 180#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~nondet3#1;call write~int#0(main_#t~nondet3#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet3#1; 181#L552-3 call main_#t~mem4#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 176#L551-1 assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1; 184#L552 assume main_#t~short7#1;call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 <= 35; 165#L552-2 [2024-11-09 15:24:17,379 INFO L747 eck$LassoCheckResult]: Loop: 165#L552-2 assume main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call main_#t~mem8#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 166#L553 assume main_#t~mem8#1 < 0;havoc main_#t~mem8#1;call write~int#0(-5, main_~x~0#1.base, main_~x~0#1.offset, 4); 173#L552-3 call main_#t~mem4#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 174#L551-1 assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1; 177#L552 assume !main_#t~short7#1; 165#L552-2 [2024-11-09 15:24:17,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:17,380 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 2 times [2024-11-09 15:24:17,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:17,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033089737] [2024-11-09 15:24:17,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:17,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:17,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:17,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:17,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:17,406 INFO L85 PathProgramCache]: Analyzing trace with hash 48745192, now seen corresponding path program 1 times [2024-11-09 15:24:17,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:17,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497849899] [2024-11-09 15:24:17,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:17,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:24:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:24:17,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:24:17,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497849899] [2024-11-09 15:24:17,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497849899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:24:17,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:24:17,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:24:17,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405534870] [2024-11-09 15:24:17,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:24:17,499 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:24:17,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:24:17,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:24:17,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:24:17,500 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:17,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:24:17,537 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-11-09 15:24:17,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2024-11-09 15:24:17,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-09 15:24:17,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 38 transitions. [2024-11-09 15:24:17,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-09 15:24:17,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-09 15:24:17,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2024-11-09 15:24:17,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:24:17,539 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-11-09 15:24:17,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2024-11-09 15:24:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2024-11-09 15:24:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-11-09 15:24:17,542 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-09 15:24:17,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:24:17,543 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-09 15:24:17,544 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:24:17,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2024-11-09 15:24:17,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-09 15:24:17,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:24:17,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:24:17,546 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:24:17,546 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:24:17,546 INFO L745 eck$LassoCheckResult]: Stem: 238#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 239#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~nondet3#1;call write~int#0(main_#t~nondet3#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet3#1; 242#L552-3 call main_#t~mem4#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 234#L551-1 assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1; 244#L552 assume main_#t~short7#1;call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 <= 35; 225#L552-2 [2024-11-09 15:24:17,546 INFO L747 eck$LassoCheckResult]: Loop: 225#L552-2 assume main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call main_#t~mem8#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 226#L553 assume main_#t~mem8#1 < 0;havoc main_#t~mem8#1;call write~int#0(-5, main_~x~0#1.base, main_~x~0#1.offset, 4); 229#L552-3 call main_#t~mem4#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 232#L551-1 assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1; 240#L552 assume main_#t~short7#1;call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 <= 35; 225#L552-2 [2024-11-09 15:24:17,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:17,547 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 3 times [2024-11-09 15:24:17,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:17,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701722775] [2024-11-09 15:24:17,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:17,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:17,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:17,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:17,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:17,578 INFO L85 PathProgramCache]: Analyzing trace with hash 48745190, now seen corresponding path program 1 times [2024-11-09 15:24:17,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:17,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450901436] [2024-11-09 15:24:17,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:17,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:17,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:17,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:17,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:17,600 INFO L85 PathProgramCache]: Analyzing trace with hash 707540352, now seen corresponding path program 1 times [2024-11-09 15:24:17,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:17,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194124700] [2024-11-09 15:24:17,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:17,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:17,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:17,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:17,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-09 15:24:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:18,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:18,066 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-11-09 15:24:18,072 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-11-09 15:24:18,075 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-11-09 15:24:18,078 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-11-09 15:24:18,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:24:18 BoogieIcfgContainer [2024-11-09 15:24:18,079 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:24:18,080 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:24:18,080 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:24:18,080 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:24:18,080 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:24:15" (3/4) ... [2024-11-09 15:24:18,082 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-09 15:24:18,085 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-11-09 15:24:18,086 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-11-09 15:24:18,120 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 15:24:18,122 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:24:18,123 INFO L158 Benchmark]: Toolchain (without parser) took 3507.78ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 112.8MB in the beginning and 145.7MB in the end (delta: -32.8MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2024-11-09 15:24:18,123 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:24:18,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.45ms. Allocated memory is still 174.1MB. Free memory was 112.8MB in the beginning and 138.8MB in the end (delta: -26.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 15:24:18,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.79ms. Allocated memory is still 174.1MB. Free memory was 138.8MB in the beginning and 136.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:24:18,126 INFO L158 Benchmark]: Boogie Preprocessor took 41.04ms. Allocated memory is still 174.1MB. Free memory was 136.8MB in the beginning and 135.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:24:18,128 INFO L158 Benchmark]: RCFGBuilder took 370.12ms. Allocated memory is still 174.1MB. Free memory was 135.5MB in the beginning and 122.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 15:24:18,129 INFO L158 Benchmark]: BuchiAutomizer took 2532.67ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 122.9MB in the beginning and 146.7MB in the end (delta: -23.8MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-11-09 15:24:18,129 INFO L158 Benchmark]: Witness Printer took 42.75ms. Allocated memory is still 209.7MB. Free memory was 146.7MB in the beginning and 145.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:24:18,131 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.16ms. Allocated memory is still 96.5MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 473.45ms. Allocated memory is still 174.1MB. Free memory was 112.8MB in the beginning and 138.8MB in the end (delta: -26.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.79ms. Allocated memory is still 174.1MB. Free memory was 138.8MB in the beginning and 136.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.04ms. Allocated memory is still 174.1MB. Free memory was 136.8MB in the beginning and 135.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 370.12ms. Allocated memory is still 174.1MB. Free memory was 135.5MB in the beginning and 122.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 2532.67ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 122.9MB in the beginning and 146.7MB in the end (delta: -23.8MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Witness Printer took 42.75ms. Allocated memory is still 209.7MB. Free memory was 146.7MB in the beginning and 145.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function null and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 77 IncrementalHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 28 mSDtfsCounter, 77 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital95 mio100 ax118 hnf100 lsp84 ukn65 mio100 lsp35 div100 bol100 ite100 ukn100 eq172 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: 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: 552]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L549] int* x = __builtin_alloca (sizeof(int)); [L550] *x = __VERIFIER_nondet_int() [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 VAL [x={2:0}] [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 VAL [x={2:0}] Loop: [L552] COND TRUE -5 <= *x && *x <= 35 [L553] EXPR \read(*x) [L553] COND TRUE *x < 0 [L554] *x = -5 [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 552]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L549] int* x = __builtin_alloca (sizeof(int)); [L550] *x = __VERIFIER_nondet_int() [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 VAL [x={2:0}] [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 VAL [x={2:0}] Loop: [L552] COND TRUE -5 <= *x && *x <= 35 [L553] EXPR \read(*x) [L553] COND TRUE *x < 0 [L554] *x = -5 [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 15:24:18,164 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)