./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 17:01:03,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 17:01:03,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-13 17:01:03,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 17:01:03,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 17:01:03,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 17:01:03,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 17:01:03,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 17:01:03,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 17:01:03,411 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 17:01:03,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 17:01:03,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 17:01:03,413 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 17:01:03,416 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 17:01:03,416 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 17:01:03,417 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 17:01:03,417 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 17:01:03,417 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 17:01:03,417 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 17:01:03,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 17:01:03,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 17:01:03,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 17:01:03,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 17:01:03,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 17:01:03,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 17:01:03,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 17:01:03,420 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 17:01:03,420 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 17:01:03,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 17:01:03,421 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 17:01:03,422 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 17:01:03,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 17:01:03,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 17:01:03,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 17:01:03,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 17:01:03,423 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 17:01:03,423 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-10-13 17:01:03,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 17:01:03,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 17:01:03,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 17:01:03,711 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 17:01:03,712 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 17:01:03,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i [2024-10-13 17:01:05,105 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 17:01:05,329 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 17:01:05,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i [2024-10-13 17:01:05,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb0a7f10/ce10d2a7ae144700864a67787c50b7cb/FLAG546e0a31e [2024-10-13 17:01:05,361 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb0a7f10/ce10d2a7ae144700864a67787c50b7cb [2024-10-13 17:01:05,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 17:01:05,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 17:01:05,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 17:01:05,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 17:01:05,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 17:01:05,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59232861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05, skipping insertion in model container [2024-10-13 17:01:05,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 17:01:05,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:01:05,690 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 17:01:05,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:01:05,786 INFO L204 MainTranslator]: Completed translation [2024-10-13 17:01:05,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05 WrapperNode [2024-10-13 17:01:05,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 17:01:05,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 17:01:05,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 17:01:05,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 17:01:05,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,821 INFO L138 Inliner]: procedures = 110, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2024-10-13 17:01:05,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 17:01:05,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 17:01:05,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 17:01:05,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 17:01:05,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,846 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-10-13 17:01:05,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 17:01:05,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 17:01:05,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 17:01:05,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 17:01:05,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:05,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:05,901 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:05,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-13 17:01:05,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 17:01:05,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 17:01:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 17:01:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 17:01:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 17:01:05,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 17:01:06,074 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 17:01:06,076 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 17:01:06,220 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-13 17:01:06,220 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 17:01:06,236 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 17:01:06,237 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 17:01:06,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:06 BoogieIcfgContainer [2024-10-13 17:01:06,238 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 17:01:06,239 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 17:01:06,239 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 17:01:06,243 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 17:01:06,243 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:01:06,244 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 05:01:05" (1/3) ... [2024-10-13 17:01:06,244 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22ecd388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:01:06, skipping insertion in model container [2024-10-13 17:01:06,245 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:01:06,245 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (2/3) ... [2024-10-13 17:01:06,246 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22ecd388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:01:06, skipping insertion in model container [2024-10-13 17:01:06,246 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:01:06,247 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:06" (3/3) ... [2024-10-13 17:01:06,248 INFO L332 chiAutomizerObserver]: Analyzing ICFG Velroyen-alloca.i [2024-10-13 17:01:06,305 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 17:01:06,305 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 17:01:06,305 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 17:01:06,305 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 17:01:06,306 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 17:01:06,306 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 17:01:06,306 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 17:01:06,307 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 17:01:06,311 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-10-13 17:01:06,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 17:01:06,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:06,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:06,335 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:01:06,335 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 17:01:06,336 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 17:01:06,336 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-10-13 17:01:06,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 17:01:06,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:06,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:06,338 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:01:06,339 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 17:01:06,346 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-10-13 17:01:06,347 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-10-13 17:01:06,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:06,357 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-13 17:01:06,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:06,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143260329] [2024-10-13 17:01:06,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:06,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:06,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:06,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:06,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:06,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1144151, now seen corresponding path program 1 times [2024-10-13 17:01:06,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:06,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278210795] [2024-10-13 17:01:06,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:06,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:06,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:06,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:06,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:06,575 INFO L85 PathProgramCache]: Analyzing trace with hash 889571353, now seen corresponding path program 1 times [2024-10-13 17:01:06,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:06,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626743306] [2024-10-13 17:01:06,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:06,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:06,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:06,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:06,985 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:01:06,986 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:01:06,986 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:01:06,986 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:01:06,987 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:01:06,987 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:06,987 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:01:06,987 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:01:06,988 INFO L132 ssoRankerPreferences]: Filename of dumped script: Velroyen-alloca.i_Iteration1_Lasso [2024-10-13 17:01:06,988 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:01:06,988 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:01:07,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,367 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:01:07,371 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:01:07,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,374 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:07,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-13 17:01:07,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:07,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:07,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:07,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:07,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:07,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:07,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:07,410 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:07,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:07,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,429 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:07,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-13 17:01:07,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:07,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:07,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:07,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:07,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:07,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:07,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:07,461 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:07,476 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-10-13 17:01:07,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,479 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:07,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-13 17:01:07,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:07,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:07,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:07,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:07,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:07,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:07,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:07,527 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:07,560 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-10-13 17:01:07,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,566 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:07,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-13 17:01:07,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:07,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:07,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:07,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:07,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:07,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:07,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:07,642 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:07,661 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-10-13 17:01:07,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,664 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-10-13 17:01:07,666 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-10-13 17:01:07,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:07,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:07,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:07,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:07,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:07,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:07,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:07,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:07,685 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:01:07,689 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-13 17:01:07,690 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 17:01:07,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,716 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-10-13 17:01:07,718 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-10-13 17:01:07,719 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:01:07,719 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 17:01:07,719 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:01:07,720 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-10-13 17:01:07,735 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-10-13 17:01:07,749 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-10-13 17:01:07,757 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:01:07,758 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:01:07,758 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2024-10-13 17:01:07,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:07,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:01:07,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:07,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 17:01:07,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:07,972 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-10-13 17:01:07,974 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-10-13 17:01:08,075 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-10-13 17:01:08,077 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-10-13 17:01:08,082 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-10-13 17:01:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2024-10-13 17:01:08,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-13 17:01:08,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:08,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 6 letters. Loop has 4 letters. [2024-10-13 17:01:08,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:08,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 2 letters. Loop has 8 letters. [2024-10-13 17:01:08,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:08,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2024-10-13 17:01:08,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 17:01:08,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 23 states and 35 transitions. [2024-10-13 17:01:08,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-10-13 17:01:08,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-13 17:01:08,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 35 transitions. [2024-10-13 17:01:08,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:01:08,098 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 35 transitions. [2024-10-13 17:01:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 35 transitions. [2024-10-13 17:01:08,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2024-10-13 17:01:08,122 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-10-13 17:01:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2024-10-13 17:01:08,124 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2024-10-13 17:01:08,125 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2024-10-13 17:01:08,125 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 17:01:08,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2024-10-13 17:01:08,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 17:01:08,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:08,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:08,129 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-13 17:01:08,129 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 17:01:08,129 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-10-13 17:01:08,129 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-10-13 17:01:08,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:08,130 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2024-10-13 17:01:08,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:08,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660736774] [2024-10-13 17:01:08,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:08,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:08,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:08,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1943531, now seen corresponding path program 2 times [2024-10-13 17:01:08,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:08,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523244062] [2024-10-13 17:01:08,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:08,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:08,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:01:08,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523244062] [2024-10-13 17:01:08,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523244062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:01:08,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:01:08,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:01:08,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968177874] [2024-10-13 17:01:08,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:01:08,321 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:01:08,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:01:08,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 17:01:08,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 17:01:08,326 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-10-13 17:01:08,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:01:08,362 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-10-13 17:01:08,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2024-10-13 17:01:08,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 17:01:08,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 27 transitions. [2024-10-13 17:01:08,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-13 17:01:08,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-13 17:01:08,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2024-10-13 17:01:08,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:01:08,364 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-10-13 17:01:08,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2024-10-13 17:01:08,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-13 17:01:08,366 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-10-13 17:01:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2024-10-13 17:01:08,367 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-10-13 17:01:08,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 17:01:08,368 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-10-13 17:01:08,368 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 17:01:08,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2024-10-13 17:01:08,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 17:01:08,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:08,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:08,370 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-13 17:01:08,370 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:01:08,370 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-10-13 17:01:08,370 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-10-13 17:01:08,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:08,371 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 2 times [2024-10-13 17:01:08,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:08,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449366268] [2024-10-13 17:01:08,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:08,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:08,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:08,395 INFO L85 PathProgramCache]: Analyzing trace with hash 48745192, now seen corresponding path program 1 times [2024-10-13 17:01:08,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:08,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413445935] [2024-10-13 17:01:08,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:08,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:08,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:01:08,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413445935] [2024-10-13 17:01:08,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413445935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:01:08,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:01:08,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:01:08,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877842566] [2024-10-13 17:01:08,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:01:08,509 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:01:08,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:01:08,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 17:01:08,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 17:01:08,510 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-10-13 17:01:08,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:01:08,549 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-10-13 17:01:08,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2024-10-13 17:01:08,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-13 17:01:08,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 38 transitions. [2024-10-13 17:01:08,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-10-13 17:01:08,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-10-13 17:01:08,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2024-10-13 17:01:08,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:01:08,552 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-10-13 17:01:08,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2024-10-13 17:01:08,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2024-10-13 17:01:08,554 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-10-13 17:01:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-10-13 17:01:08,555 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-10-13 17:01:08,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 17:01:08,557 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-10-13 17:01:08,557 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 17:01:08,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2024-10-13 17:01:08,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-10-13 17:01:08,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:08,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:08,559 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-13 17:01:08,559 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:01:08,559 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-10-13 17:01:08,559 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-10-13 17:01:08,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:08,560 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 3 times [2024-10-13 17:01:08,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:08,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39816270] [2024-10-13 17:01:08,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:08,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:08,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:08,577 INFO L85 PathProgramCache]: Analyzing trace with hash 48745190, now seen corresponding path program 1 times [2024-10-13 17:01:08,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:08,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125412367] [2024-10-13 17:01:08,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:08,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:08,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:08,597 INFO L85 PathProgramCache]: Analyzing trace with hash 707540352, now seen corresponding path program 1 times [2024-10-13 17:01:08,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:08,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774316305] [2024-10-13 17:01:08,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:08,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:09,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:09,036 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-10-13 17:01:09,039 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-10-13 17:01:09,042 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-10-13 17:01:09,043 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-10-13 17:01:09,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 05:01:09 BoogieIcfgContainer [2024-10-13 17:01:09,043 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-13 17:01:09,044 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 17:01:09,044 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 17:01:09,044 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 17:01:09,044 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:06" (3/4) ... [2024-10-13 17:01:09,047 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-13 17:01:09,048 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-10-13 17:01:09,049 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-10-13 17:01:09,080 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 17:01:09,080 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 17:01:09,081 INFO L158 Benchmark]: Toolchain (without parser) took 3716.68ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 87.9MB in the beginning and 75.4MB in the end (delta: 12.5MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. [2024-10-13 17:01:09,081 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 159.4MB. Free memory was 112.6MB in the beginning and 112.5MB in the end (delta: 141.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:01:09,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.89ms. Allocated memory is still 159.4MB. Free memory was 87.8MB in the beginning and 126.6MB in the end (delta: -38.9MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2024-10-13 17:01:09,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.10ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 125.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:01:09,084 INFO L158 Benchmark]: Boogie Preprocessor took 37.28ms. Allocated memory is still 159.4MB. Free memory was 125.4MB in the beginning and 123.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:01:09,084 INFO L158 Benchmark]: RCFGBuilder took 378.09ms. Allocated memory is still 159.4MB. Free memory was 123.3MB in the beginning and 110.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 17:01:09,084 INFO L158 Benchmark]: BuchiAutomizer took 2804.48ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 110.7MB in the beginning and 77.5MB in the end (delta: 33.3MB). Peak memory consumption was 76.1MB. Max. memory is 16.1GB. [2024-10-13 17:01:09,085 INFO L158 Benchmark]: Witness Printer took 36.59ms. Allocated memory is still 205.5MB. Free memory was 77.5MB in the beginning and 75.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:01:09,087 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.52ms. Allocated memory is still 159.4MB. Free memory was 112.6MB in the beginning and 112.5MB in the end (delta: 141.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.89ms. Allocated memory is still 159.4MB. Free memory was 87.8MB in the beginning and 126.6MB in the end (delta: -38.9MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.10ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 125.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.28ms. Allocated memory is still 159.4MB. Free memory was 125.4MB in the beginning and 123.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 378.09ms. Allocated memory is still 159.4MB. Free memory was 123.3MB in the beginning and 110.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 2804.48ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 110.7MB in the beginning and 77.5MB in the end (delta: 33.3MB). Peak memory consumption was 76.1MB. Max. memory is 16.1GB. * Witness Printer took 36.59ms. Allocated memory is still 205.5MB. Free memory was 77.5MB in the beginning and 75.4MB in the end (delta: 2.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.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. 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: 38ms 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-10-13 17:01:09,109 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-10-13 17:01:09,313 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)