./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Urban-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/Urban-alloca-2.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 1d6689857addc69d8e93b105a4c59c28f3ca430e8db3cb8066938aeb93b34a30 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:18:53,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:18:53,045 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:18:53,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:18:53,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:18:53,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:18:53,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:18:53,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:18:53,076 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:18:53,076 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:18:53,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:18:53,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:18:53,077 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:18:53,078 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:18:53,078 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:18:53,078 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:18:53,079 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:18:53,079 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:18:53,080 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:18:53,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:18:53,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:18:53,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:18:53,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:18:53,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:18:53,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:18:53,083 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:18:53,084 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:18:53,084 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:18:53,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:18:53,084 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:18:53,084 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:18:53,084 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:18:53,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:18:53,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:18:53,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:18:53,085 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:18:53,085 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 -> 1d6689857addc69d8e93b105a4c59c28f3ca430e8db3cb8066938aeb93b34a30 [2024-11-19 14:18:53,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:18:53,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:18:53,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:18:53,380 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:18:53,381 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:18:53,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Urban-alloca-2.i [2024-11-19 14:18:54,704 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:18:54,916 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:18:54,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-alloca-2.i [2024-11-19 14:18:54,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7912025e1/f7df411f87274de3b9b86ae4bc2c7d8d/FLAGe106a960a [2024-11-19 14:18:55,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7912025e1/f7df411f87274de3b9b86ae4bc2c7d8d [2024-11-19 14:18:55,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:18:55,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:18:55,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:18:55,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:18:55,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:18:55,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e4eedec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55, skipping insertion in model container [2024-11-19 14:18:55,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:18:55,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:18:55,497 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:18:55,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:18:55,553 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:18:55,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55 WrapperNode [2024-11-19 14:18:55,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:18:55,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:18:55,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:18:55,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:18:55,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,567 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,582 INFO L138 Inliner]: procedures = 110, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2024-11-19 14:18:55,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:18:55,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:18:55,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:18:55,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:18:55,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,608 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [7, 8]. 53 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 8 writes are split as follows [4, 4]. [2024-11-19 14:18:55,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,613 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:18:55,627 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:18:55,627 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:18:55,627 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:18:55,630 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:18:55,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:18:55,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:18:55,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:18:55,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 14:18:55,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 14:18:55,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 14:18:55,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 14:18:55,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 14:18:55,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:18:55,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:18:55,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:18:55,850 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:18:55,855 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:18:55,983 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-19 14:18:55,983 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:18:55,996 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:18:55,996 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 14:18:55,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:18:55 BoogieIcfgContainer [2024-11-19 14:18:55,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:18:55,997 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:18:55,997 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:18:56,000 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:18:56,000 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:18:56,001 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:18:55" (1/3) ... [2024-11-19 14:18:56,001 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@496b53a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:18:56, skipping insertion in model container [2024-11-19 14:18:56,001 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:18:56,001 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (2/3) ... [2024-11-19 14:18:56,002 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@496b53a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:18:56, skipping insertion in model container [2024-11-19 14:18:56,002 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:18:56,002 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:18:55" (3/3) ... [2024-11-19 14:18:56,003 INFO L332 chiAutomizerObserver]: Analyzing ICFG Urban-alloca-2.i [2024-11-19 14:18:56,038 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:18:56,039 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:18:56,039 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:18:56,039 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:18:56,039 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:18:56,039 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:18:56,039 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:18:56,039 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:18:56,042 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-19 14:18:56,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-19 14:18:56,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:18:56,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:18:56,060 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:18:56,060 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-19 14:18:56,060 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:18:56,061 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-19 14:18:56,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-19 14:18:56,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:18:56,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:18:56,062 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:18:56,062 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-19 14:18:56,068 INFO L745 eck$LassoCheckResult]: Stem: 8#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~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;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1; 9#L561-2true [2024-11-19 14:18:56,068 INFO L747 eck$LassoCheckResult]: Loop: 9#L561-2true call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 11#L552-1true assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 4#L552-3true assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4); 3#L553true assume !(main_#t~mem9#1 > 0);havoc main_#t~mem9#1;havoc main_#t~nondet14#1; 6#L561true assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(1 + main_#t~mem15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem15#1; 9#L561-2true [2024-11-19 14:18:56,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:56,073 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:18:56,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:56,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032509625] [2024-11-19 14:18:56,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:18:56,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:56,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:18:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:56,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:18:56,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:56,190 INFO L85 PathProgramCache]: Analyzing trace with hash 35409937, now seen corresponding path program 1 times [2024-11-19 14:18:56,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:56,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742109048] [2024-11-19 14:18:56,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:18:56,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:56,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:18:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:56,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:18:56,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:56,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849423, now seen corresponding path program 1 times [2024-11-19 14:18:56,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:56,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000567865] [2024-11-19 14:18:56,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:18:56,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:56,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:18:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:56,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:18:56,704 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:18:56,705 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:18:56,705 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:18:56,705 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:18:56,705 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:18:56,705 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:18:56,705 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:18:56,705 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:18:56,705 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration1_Lasso [2024-11-19 14:18:56,705 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:18:56,706 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:18:56,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:56,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:56,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:56,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:56,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:56,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:56,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:56,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:56,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:56,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:56,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:56,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:57,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:57,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:57,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:57,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:57,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:57,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:57,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:57,334 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:18:57,338 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:18:57,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:18:57,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:18:57,341 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:18:57,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-19 14:18:57,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:18:57,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:18:57,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:18:57,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:18:57,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:18:57,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:18:57,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:18:57,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:18:57,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:18:57,372 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-11-19 14:18:57,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:18:57,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:18:57,375 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:18:57,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-19 14:18:57,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-11-19 14:18:57,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:18:57,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:18:57,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:18:57,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:18:57,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:18:57,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:18:57,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:18:57,390 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:18:57,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-19 14:18:57,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:18:57,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:18:57,406 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:18:57,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-19 14:18:57,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:18:57,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:18:57,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:18:57,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:18:57,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:18:57,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:18:57,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:18:57,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:18:57,425 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:18:57,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-19 14:18:57,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:18:57,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:18:57,443 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:18:57,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 14:18:57,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:18:57,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:18:57,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:18:57,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:18:57,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:18:57,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:18:57,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:18:57,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:18:57,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:18:57,476 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-19 14:18:57,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:18:57,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:18:57,479 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:18:57,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 14:18:57,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:18:57,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:18:57,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:18:57,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:18:57,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:18:57,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:18:57,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:18:57,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:18:57,493 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:18:57,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-19 14:18:57,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:18:57,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:18:57,506 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-19 14:18:57,507 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-19 14:18:57,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:18:57,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:18:57,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:18:57,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:18:57,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:18:57,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:18:57,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:18:57,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:18:57,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:18:57,531 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-19 14:18:57,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:18:57,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:18:57,533 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:18:57,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:18:57,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-19 14:18:57,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:18:57,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:18:57,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:18:57,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:18:57,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:18:57,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:18:57,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:18:57,551 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:18:57,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-19 14:18:57,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:18:57,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:18:57,570 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:18:57,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-19 14:18:57,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:18:57,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:18:57,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:18:57,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:18:57,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:18:57,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:18:57,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:18:57,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:18:57,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-19 14:18:57,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:18:57,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:18:57,607 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:18:57,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-19 14:18:57,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:18:57,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:18:57,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:18:57,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:18:57,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:18:57,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:18:57,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:18:57,629 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:18:57,646 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-19 14:18:57,647 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-19 14:18:57,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:18:57,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:18:57,650 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:18:57,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-19 14:18:57,652 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:18:57,663 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:18:57,663 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:18:57,664 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) 0)_1) = -1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) 0)_1 Supporting invariants [] [2024-11-19 14:18:57,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-19 14:18:57,743 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2024-11-19 14:18:57,760 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-19 14:18:57,761 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-19 14:18:57,761 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2024-11-19 14:18:57,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:18:57,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 14:18:57,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:18:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:18:57,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:18:57,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:18:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:18:58,026 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-11-19 14:18:58,030 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 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:18:58,239 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 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 48 states and 71 transitions. Complement of second has 16 states. [2024-11-19 14:18:58,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2024-11-19 14:18:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:18:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2024-11-19 14:18:58,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 2 letters. Loop has 5 letters. [2024-11-19 14:18:58,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:18:58,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 7 letters. Loop has 5 letters. [2024-11-19 14:18:58,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:18:58,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 2 letters. Loop has 10 letters. [2024-11-19 14:18:58,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:18:58,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 71 transitions. [2024-11-19 14:18:58,260 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-19 14:18:58,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 26 states and 37 transitions. [2024-11-19 14:18:58,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-19 14:18:58,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-19 14:18:58,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2024-11-19 14:18:58,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:18:58,268 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 37 transitions. [2024-11-19 14:18:58,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2024-11-19 14:18:58,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-11-19 14:18:58,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:18:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2024-11-19 14:18:58,296 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2024-11-19 14:18:58,297 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2024-11-19 14:18:58,299 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:18:58,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2024-11-19 14:18:58,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-19 14:18:58,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:18:58,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:18:58,301 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-19 14:18:58,301 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-19 14:18:58,301 INFO L745 eck$LassoCheckResult]: Stem: 184#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 185#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~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;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1; 190#L561-2 call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 189#L552-1 assume !main_#t~short8#1; 191#L552-3 [2024-11-19 14:18:58,301 INFO L747 eck$LassoCheckResult]: Loop: 191#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4); 194#L553 assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1; 195#L554 assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1;call main_#t~mem13#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#0(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1; 186#L561-2 call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 187#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 191#L552-3 [2024-11-19 14:18:58,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:58,302 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2024-11-19 14:18:58,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:58,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157757099] [2024-11-19 14:18:58,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:18:58,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:58,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:18:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:58,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:18:58,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:58,362 INFO L85 PathProgramCache]: Analyzing trace with hash 45903353, now seen corresponding path program 1 times [2024-11-19 14:18:58,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:58,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965842499] [2024-11-19 14:18:58,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:18:58,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:58,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:18:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:58,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:18:58,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:58,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1272522354, now seen corresponding path program 1 times [2024-11-19 14:18:58,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:58,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912930999] [2024-11-19 14:18:58,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:18:58,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:18:58,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:18:58,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:18:58,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912930999] [2024-11-19 14:18:58,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912930999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:18:58,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:18:58,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:18:58,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459927184] [2024-11-19 14:18:58,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:18:58,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-19 14:18:58,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:18:58,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:18:58,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:18:58,624 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:18:58,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:18:58,635 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2024-11-19 14:18:58,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2024-11-19 14:18:58,636 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-19 14:18:58,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 32 transitions. [2024-11-19 14:18:58,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-19 14:18:58,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-19 14:18:58,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2024-11-19 14:18:58,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:18:58,638 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 32 transitions. [2024-11-19 14:18:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2024-11-19 14:18:58,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-19 14:18:58,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 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-19 14:18:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2024-11-19 14:18:58,640 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-11-19 14:18:58,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:18:58,642 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-11-19 14:18:58,643 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:18:58,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2024-11-19 14:18:58,643 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-19 14:18:58,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:18:58,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:18:58,644 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 14:18:58,644 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-19 14:18:58,644 INFO L745 eck$LassoCheckResult]: Stem: 243#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 244#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~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;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1; 249#L561-2 call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 246#L552-1 [2024-11-19 14:18:58,645 INFO L747 eck$LassoCheckResult]: Loop: 246#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 253#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4); 251#L553 assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1; 252#L554 assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1;call main_#t~mem13#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#0(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1; 245#L561-2 call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 246#L552-1 [2024-11-19 14:18:58,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:58,646 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-11-19 14:18:58,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:58,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313528239] [2024-11-19 14:18:58,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:18:58,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:58,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:18:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:58,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:18:58,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:58,664 INFO L85 PathProgramCache]: Analyzing trace with hash 38421593, now seen corresponding path program 2 times [2024-11-19 14:18:58,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:58,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707290834] [2024-11-19 14:18:58,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:18:58,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:58,671 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:18:58,672 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:18:58,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:18:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:58,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:18:58,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:58,677 INFO L85 PathProgramCache]: Analyzing trace with hash 177749398, now seen corresponding path program 1 times [2024-11-19 14:18:58,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:58,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168650326] [2024-11-19 14:18:58,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:18:58,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:58,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:18:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:58,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:18:59,072 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:18:59,072 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:18:59,073 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:18:59,073 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:18:59,073 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:18:59,073 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:18:59,073 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:18:59,073 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:18:59,073 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration3_Lasso [2024-11-19 14:18:59,073 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:18:59,073 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:18:59,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:59,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:59,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:59,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:59,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:59,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:59,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:59,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:59,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:59,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:59,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:59,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:59,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:59,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:59,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:59,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:59,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:59,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:18:59,433 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:18:59,434 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:18:59,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:18:59,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:18:59,435 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:18:59,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-19 14:18:59,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:18:59,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:18:59,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:18:59,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:18:59,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:18:59,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:18:59,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:18:59,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:18:59,451 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:18:59,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-19 14:18:59,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:18:59,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:18:59,465 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:18:59,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-19 14:18:59,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:18:59,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:18:59,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:18:59,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:18:59,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:18:59,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:18:59,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:18:59,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:18:59,479 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:18:59,482 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:18:59,482 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-19 14:18:59,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:18:59,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:18:59,483 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:18:59,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-19 14:18:59,486 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:18:59,486 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:18:59,486 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:18:59,487 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_2 Supporting invariants [] [2024-11-19 14:18:59,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-19 14:18:59,544 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2024-11-19 14:18:59,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:18:59,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:18:59,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y~0!base,]]] [2024-11-19 14:18:59,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:18:59,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:18:59,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:18:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:18:59,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 14:18:59,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:18:59,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-19 14:18:59,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 16 [2024-11-19 14:18:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:18:59,766 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-11-19 14:18:59,766 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:18:59,802 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 30 transitions. cyclomatic complexity: 11. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 61 states and 77 transitions. Complement of second has 9 states. [2024-11-19 14:18:59,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-19 14:18:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:18:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2024-11-19 14:18:59,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 3 letters. Loop has 5 letters. [2024-11-19 14:18:59,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:18:59,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 5 letters. [2024-11-19 14:18:59,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:18:59,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 3 letters. Loop has 10 letters. [2024-11-19 14:18:59,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:18:59,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 77 transitions. [2024-11-19 14:18:59,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-19 14:18:59,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 59 states and 75 transitions. [2024-11-19 14:18:59,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-19 14:18:59,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-19 14:18:59,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 75 transitions. [2024-11-19 14:18:59,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:18:59,809 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 75 transitions. [2024-11-19 14:18:59,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 75 transitions. [2024-11-19 14:18:59,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2024-11-19 14:18:59,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 45 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:18:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2024-11-19 14:18:59,814 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 62 transitions. [2024-11-19 14:18:59,814 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2024-11-19 14:18:59,814 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:18:59,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 62 transitions. [2024-11-19 14:18:59,815 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-19 14:18:59,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:18:59,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:18:59,816 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:18:59,816 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-19 14:18:59,816 INFO L745 eck$LassoCheckResult]: Stem: 417#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 418#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~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;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1; 419#L561-2 call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 420#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 411#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4); 407#L553 assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1; 408#L554 assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~nondet12#1;call write~int#0(main_#t~nondet12#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet12#1; 425#L561-2 [2024-11-19 14:18:59,816 INFO L747 eck$LassoCheckResult]: Loop: 425#L561-2 call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 435#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 434#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4); 428#L553 assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1; 429#L554 assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~nondet12#1;call write~int#0(main_#t~nondet12#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet12#1; 425#L561-2 [2024-11-19 14:18:59,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:59,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849167, now seen corresponding path program 1 times [2024-11-19 14:18:59,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:59,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679838565] [2024-11-19 14:18:59,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:18:59,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:59,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:18:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:59,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:18:59,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:59,851 INFO L85 PathProgramCache]: Analyzing trace with hash 35409681, now seen corresponding path program 1 times [2024-11-19 14:18:59,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:59,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810572656] [2024-11-19 14:18:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:18:59,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:59,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:18:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:59,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:18:59,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:59,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1594794819, now seen corresponding path program 2 times [2024-11-19 14:18:59,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:59,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464119891] [2024-11-19 14:18:59,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:18:59,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:59,877 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:18:59,877 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:18:59,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:18:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:59,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:00,252 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:19:00,252 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:19:00,252 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:19:00,252 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:19:00,252 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:19:00,252 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:00,252 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:19:00,252 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:19:00,252 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration4_Lasso [2024-11-19 14:19:00,252 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:19:00,252 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:19:00,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:00,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:00,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:00,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:00,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:00,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:00,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:00,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:00,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:00,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:00,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:00,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:00,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:00,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:00,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:00,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:00,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:00,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:00,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:00,678 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:19:00,678 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:19:00,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:00,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:00,683 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:00,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-19 14:19:00,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:00,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:00,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:00,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:00,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:00,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:00,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:00,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:00,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:00,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-19 14:19:00,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:00,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:00,711 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:00,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-19 14:19:00,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:00,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:00,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:00,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:00,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:00,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:00,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:00,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:00,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:00,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:00,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:00,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:00,737 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:00,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-19 14:19:00,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:00,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:00,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:00,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:00,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:00,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:00,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:00,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:00,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:00,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:00,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:00,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:00,771 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:00,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-19 14:19:00,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:00,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:00,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:00,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:00,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:00,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:00,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:00,819 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:00,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-19 14:19:00,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:00,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:00,857 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:00,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-19 14:19:00,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:00,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:00,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:00,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:00,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:00,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:00,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:00,878 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:00,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-19 14:19:00,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:00,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:00,893 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:00,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-19 14:19:00,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:00,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:00,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:00,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:00,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:00,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:00,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:00,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:00,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-19 14:19:00,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:00,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:00,925 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:00,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-19 14:19:00,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:00,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:00,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:00,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:00,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:00,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:00,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:00,944 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:00,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:00,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:00,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:00,956 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:00,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-19 14:19:00,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:00,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:00,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:00,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:00,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:00,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:00,971 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:00,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:00,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:00,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:00,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:00,994 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:00,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-19 14:19:00,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:01,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:01,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:01,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:01,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:01,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:01,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:01,024 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:01,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:01,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:01,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:01,036 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:01,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-19 14:19:01,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:01,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:01,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:01,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:01,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:01,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:01,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:01,053 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:19:01,060 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-19 14:19:01,060 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-19 14:19:01,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:01,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:01,062 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:01,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-19 14:19:01,064 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:19:01,078 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:19:01,079 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:19:01,079 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_3) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_3 Supporting invariants [] [2024-11-19 14:19:01,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:01,105 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2024-11-19 14:19:01,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-19 14:19:01,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-19 14:19:01,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2024-11-19 14:19:01,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:01,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:19:01,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:01,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:19:01,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:01,172 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-19 14:19:01,172 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 62 transitions. cyclomatic complexity: 22 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:01,236 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 62 transitions. cyclomatic complexity: 22. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 91 transitions. Complement of second has 11 states. [2024-11-19 14:19:01,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-11-19 14:19:01,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:01,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2024-11-19 14:19:01,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 7 letters. Loop has 5 letters. [2024-11-19 14:19:01,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:01,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 12 letters. Loop has 5 letters. [2024-11-19 14:19:01,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:01,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 7 letters. Loop has 10 letters. [2024-11-19 14:19:01,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:01,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 91 transitions. [2024-11-19 14:19:01,238 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-11-19 14:19:01,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 66 states and 89 transitions. [2024-11-19 14:19:01,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-11-19 14:19:01,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-19 14:19:01,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 89 transitions. [2024-11-19 14:19:01,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:01,239 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 89 transitions. [2024-11-19 14:19:01,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 89 transitions. [2024-11-19 14:19:01,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2024-11-19 14:19:01,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 57 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2024-11-19 14:19:01,242 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 78 transitions. [2024-11-19 14:19:01,242 INFO L425 stractBuchiCegarLoop]: Abstraction has 58 states and 78 transitions. [2024-11-19 14:19:01,242 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:19:01,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 78 transitions. [2024-11-19 14:19:01,243 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-11-19 14:19:01,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:01,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:01,243 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-19 14:19:01,243 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-19 14:19:01,243 INFO L745 eck$LassoCheckResult]: Stem: 641#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 642#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~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;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1; 648#L561-2 call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 661#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 636#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4); 632#L553 assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1; 633#L554 assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~nondet12#1;call write~int#0(main_#t~nondet12#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet12#1; 664#L561-2 call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 644#L552-1 [2024-11-19 14:19:01,243 INFO L747 eck$LassoCheckResult]: Loop: 644#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 649#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4); 655#L553 assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1; 651#L554 assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1;call main_#t~mem13#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#0(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1; 643#L561-2 call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 644#L552-1 [2024-11-19 14:19:01,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:01,243 INFO L85 PathProgramCache]: Analyzing trace with hash 177749336, now seen corresponding path program 3 times [2024-11-19 14:19:01,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:01,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524432880] [2024-11-19 14:19:01,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:19:01,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:01,259 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 14:19:01,259 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:01,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:01,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:01,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:01,265 INFO L85 PathProgramCache]: Analyzing trace with hash 38421593, now seen corresponding path program 3 times [2024-11-19 14:19:01,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:01,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919677522] [2024-11-19 14:19:01,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:19:01,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:01,270 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:19:01,270 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:01,270 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:01,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:01,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:01,273 INFO L85 PathProgramCache]: Analyzing trace with hash -2100968094, now seen corresponding path program 1 times [2024-11-19 14:19:01,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:01,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108753573] [2024-11-19 14:19:01,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:01,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:01,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:01,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:01,732 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:19:01,733 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:19:01,733 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:19:01,733 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:19:01,733 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:19:01,733 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:01,733 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:19:01,733 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:19:01,733 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration5_Lasso [2024-11-19 14:19:01,733 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:19:01,733 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:19:01,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:02,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:02,245 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:19:02,245 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:19:02,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:02,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:02,247 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:02,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-19 14:19:02,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:02,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:02,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:02,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:02,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:02,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:02,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:02,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:02,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-19 14:19:02,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:02,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:02,284 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:02,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-19 14:19:02,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:02,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:02,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:02,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:02,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:02,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:02,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:02,309 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:02,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-19 14:19:02,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:02,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:02,328 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:02,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-19 14:19:02,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:02,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:02,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:02,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:02,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:02,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:02,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:02,350 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:02,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-19 14:19:02,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:02,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:02,390 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:02,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-19 14:19:02,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:02,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:02,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:02,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:02,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:02,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:02,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:02,413 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:02,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-19 14:19:02,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:02,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:02,428 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:02,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-19 14:19:02,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:02,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:02,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:02,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:02,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:02,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:02,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:02,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:02,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:02,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:02,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:02,459 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:02,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-19 14:19:02,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:02,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:02,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:02,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:02,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:02,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:02,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:02,474 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:02,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-19 14:19:02,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:02,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:02,487 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:02,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-19 14:19:02,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:02,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:02,498 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-19 14:19:02,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:02,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:02,500 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-19 14:19:02,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:02,507 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:02,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:02,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:02,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:02,520 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:02,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-19 14:19:02,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:02,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:02,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:02,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:02,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:02,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:02,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:02,543 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:19:02,553 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-19 14:19:02,554 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-19 14:19:02,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:02,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:02,556 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:02,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-19 14:19:02,557 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:19:02,568 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:19:02,568 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:19:02,568 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) 0)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) 0)_2 Supporting invariants [] [2024-11-19 14:19:02,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:02,607 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2024-11-19 14:19:02,609 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:19:02,609 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:19:02,609 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y~0!base,]]] [2024-11-19 14:19:02,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:02,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 14:19:02,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:02,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:19:02,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:02,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 16 [2024-11-19 14:19:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:02,761 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-19 14:19:02,762 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 78 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:02,820 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 78 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 114 states and 145 transitions. Complement of second has 10 states. [2024-11-19 14:19:02,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-19 14:19:02,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:02,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2024-11-19 14:19:02,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 8 letters. Loop has 5 letters. [2024-11-19 14:19:02,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:02,822 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:19:02,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:02,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 14:19:02,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:02,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:19:02,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:02,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 16 [2024-11-19 14:19:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:02,990 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-19 14:19:02,990 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 78 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:03,044 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 78 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 109 states and 142 transitions. Complement of second has 10 states. [2024-11-19 14:19:03,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-19 14:19:03,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-11-19 14:19:03,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 8 letters. Loop has 5 letters. [2024-11-19 14:19:03,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:03,047 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:19:03,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:03,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 14:19:03,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:03,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:19:03,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:03,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 16 [2024-11-19 14:19:03,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:03,196 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-19 14:19:03,196 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 78 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:03,250 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 78 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 146 states and 182 transitions. Complement of second has 14 states. [2024-11-19 14:19:03,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-19 14:19:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-11-19 14:19:03,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 8 letters. Loop has 5 letters. [2024-11-19 14:19:03,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:03,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 13 letters. Loop has 5 letters. [2024-11-19 14:19:03,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:03,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 8 letters. Loop has 10 letters. [2024-11-19 14:19:03,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:03,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 182 transitions. [2024-11-19 14:19:03,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2024-11-19 14:19:03,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 94 states and 119 transitions. [2024-11-19 14:19:03,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-19 14:19:03,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-11-19 14:19:03,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 119 transitions. [2024-11-19 14:19:03,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:03,271 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94 states and 119 transitions. [2024-11-19 14:19:03,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 119 transitions. [2024-11-19 14:19:03,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 76. [2024-11-19 14:19:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 75 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2024-11-19 14:19:03,278 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 101 transitions. [2024-11-19 14:19:03,278 INFO L425 stractBuchiCegarLoop]: Abstraction has 76 states and 101 transitions. [2024-11-19 14:19:03,278 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:19:03,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 101 transitions. [2024-11-19 14:19:03,279 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-11-19 14:19:03,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:03,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:03,279 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-19 14:19:03,279 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-19 14:19:03,279 INFO L745 eck$LassoCheckResult]: Stem: 1306#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1307#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~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;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1; 1310#L561-2 call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 1358#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 1351#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4); 1349#L553 assume !(main_#t~mem9#1 > 0);havoc main_#t~mem9#1;havoc main_#t~nondet14#1; 1344#L561 assume !(0 != main_#t~nondet14#1);havoc main_#t~nondet14#1;call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#0(main_#t~mem16#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~nondet17#1;call write~int#1(main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet17#1; 1341#L561-2 call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 1340#L552-1 [2024-11-19 14:19:03,279 INFO L747 eck$LassoCheckResult]: Loop: 1340#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 1325#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4); 1317#L553 assume !(main_#t~mem9#1 > 0);havoc main_#t~mem9#1;havoc main_#t~nondet14#1; 1318#L561 assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(1 + main_#t~mem15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem15#1; 1343#L561-2 call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 1340#L552-1 [2024-11-19 14:19:03,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:03,279 INFO L85 PathProgramCache]: Analyzing trace with hash 177757334, now seen corresponding path program 1 times [2024-11-19 14:19:03,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:03,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232903210] [2024-11-19 14:19:03,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:03,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:03,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:03,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:03,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:03,321 INFO L85 PathProgramCache]: Analyzing trace with hash 38429467, now seen corresponding path program 2 times [2024-11-19 14:19:03,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:03,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389397677] [2024-11-19 14:19:03,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:19:03,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:03,333 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:19:03,333 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:03,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:03,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:03,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:03,344 INFO L85 PathProgramCache]: Analyzing trace with hash -758277210, now seen corresponding path program 1 times [2024-11-19 14:19:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:03,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297519778] [2024-11-19 14:19:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:03,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:03,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:03,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:03,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:03,933 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:19:03,933 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:19:03,934 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:19:03,934 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:19:03,934 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:19:03,934 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:03,934 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:19:03,934 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:19:03,934 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration6_Lasso [2024-11-19 14:19:03,934 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:19:03,934 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:19:03,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:04,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:04,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:04,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:04,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:04,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:04,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:04,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:04,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:04,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:04,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:04,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:04,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:04,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:04,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:04,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:04,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:04,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:04,492 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:19:04,492 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:19:04,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:04,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:04,494 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:04,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-19 14:19:04,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:04,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:04,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:04,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:04,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:04,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:04,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:04,511 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:04,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-19 14:19:04,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:04,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:04,524 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:04,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-19 14:19:04,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:04,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:04,536 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-11-19 14:19:04,536 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2024-11-19 14:19:04,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:04,560 INFO L401 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2024-11-19 14:19:04,560 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2024-11-19 14:19:04,633 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:19:04,737 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-19 14:19:04,737 INFO L444 ModelExtractionUtils]: 10 out of 29 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-11-19 14:19:04,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:04,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:04,738 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:04,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-19 14:19:04,740 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:19:04,752 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2024-11-19 14:19:04,753 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:19:04,753 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_5) = -2*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_5 + 1 Supporting invariants [] [2024-11-19 14:19:04,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-19 14:19:04,787 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2024-11-19 14:19:04,788 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-19 14:19:04,788 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-19 14:19:04,788 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2024-11-19 14:19:04,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:04,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:19:04,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:04,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:19:04,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:04,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-19 14:19:04,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:04,856 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-11-19 14:19:04,857 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 101 transitions. cyclomatic complexity: 33 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:04,882 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 101 transitions. cyclomatic complexity: 33. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 101 states and 134 transitions. Complement of second has 9 states. [2024-11-19 14:19:04,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-19 14:19:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2024-11-19 14:19:04,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 5 letters. [2024-11-19 14:19:04,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:04,883 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:19:04,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:04,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:19:04,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:04,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:19:04,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:04,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-19 14:19:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:04,958 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2024-11-19 14:19:04,958 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 101 transitions. cyclomatic complexity: 33 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:05,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:05,021 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 101 transitions. cyclomatic complexity: 33. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 104 states and 137 transitions. Complement of second has 11 states. [2024-11-19 14:19:05,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-11-19 14:19:05,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:05,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2024-11-19 14:19:05,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 8 letters. Loop has 5 letters. [2024-11-19 14:19:05,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:05,023 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:19:05,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:05,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:19:05,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:05,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:19:05,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:05,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-19 14:19:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:05,108 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-11-19 14:19:05,108 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 101 transitions. cyclomatic complexity: 33 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:05,142 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 101 transitions. cyclomatic complexity: 33. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 165 states and 220 transitions. Complement of second has 11 states. [2024-11-19 14:19:05,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-19 14:19:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:05,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2024-11-19 14:19:05,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 5 letters. [2024-11-19 14:19:05,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:05,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 13 letters. Loop has 5 letters. [2024-11-19 14:19:05,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:05,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 10 letters. [2024-11-19 14:19:05,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:05,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 220 transitions. [2024-11-19 14:19:05,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2024-11-19 14:19:05,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 126 states and 168 transitions. [2024-11-19 14:19:05,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-19 14:19:05,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-11-19 14:19:05,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 168 transitions. [2024-11-19 14:19:05,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:05,148 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 168 transitions. [2024-11-19 14:19:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 168 transitions. [2024-11-19 14:19:05,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2024-11-19 14:19:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 91 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2024-11-19 14:19:05,153 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-11-19 14:19:05,153 INFO L425 stractBuchiCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-11-19 14:19:05,153 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:19:05,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 129 transitions. [2024-11-19 14:19:05,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2024-11-19 14:19:05,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:05,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:05,155 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 14:19:05,155 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2024-11-19 14:19:05,155 INFO L745 eck$LassoCheckResult]: Stem: 1968#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1969#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~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;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1; 1976#L561-2 call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 1985#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 1963#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4); 1959#L553 assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1; 1960#L554 assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~nondet12#1;call write~int#0(main_#t~nondet12#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet12#1; 1970#L561-2 call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 1972#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 2011#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4); 2007#L553 assume !(main_#t~mem9#1 > 0);havoc main_#t~mem9#1;havoc main_#t~nondet14#1; 2002#L561 assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(1 + main_#t~mem15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem15#1; 2003#L561-2 call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 1991#L552-1 [2024-11-19 14:19:05,155 INFO L747 eck$LassoCheckResult]: Loop: 1991#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 1988#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4); 1987#L553 assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1; 1980#L554 assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~nondet12#1;call write~int#0(main_#t~nondet12#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet12#1; 1981#L561-2 call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 2001#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 2011#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4); 2007#L553 assume !(main_#t~mem9#1 > 0);havoc main_#t~mem9#1;havoc main_#t~nondet14#1; 2002#L561 assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(1 + main_#t~mem15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem15#1; 2003#L561-2 call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 1991#L552-1 [2024-11-19 14:19:05,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:05,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2100960220, now seen corresponding path program 1 times [2024-11-19 14:19:05,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:05,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79647368] [2024-11-19 14:19:05,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:05,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:05,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:19:05,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79647368] [2024-11-19 14:19:05,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79647368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:19:05,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:19:05,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 14:19:05,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147569175] [2024-11-19 14:19:05,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:19:05,287 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:19:05,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash 338206529, now seen corresponding path program 1 times [2024-11-19 14:19:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:05,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358801103] [2024-11-19 14:19:05,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:05,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:05,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:19:05,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358801103] [2024-11-19 14:19:05,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358801103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:19:05,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887114045] [2024-11-19 14:19:05,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:05,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:19:05,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:05,430 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:19:05,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-19 14:19:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:05,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 14:19:05,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:05,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 14:19:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:05,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:19:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:05,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887114045] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:19:05,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:19:05,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-19 14:19:05,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522790820] [2024-11-19 14:19:05,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:19:05,656 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:19:05,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:19:05,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 14:19:05,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-19 14:19:05,657 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. cyclomatic complexity: 43 Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:05,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:19:05,714 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2024-11-19 14:19:05,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 100 transitions. [2024-11-19 14:19:05,715 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:19:05,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 0 states and 0 transitions. [2024-11-19 14:19:05,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 14:19:05,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 14:19:05,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 14:19:05,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:19:05,715 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:19:05,715 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:19:05,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 14:19:05,717 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:19:05,717 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:19:05,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-19 14:19:05,717 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:19:05,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-19 14:19:05,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:19:05 BoogieIcfgContainer [2024-11-19 14:19:05,722 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:19:05,723 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:19:05,723 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:19:05,723 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:19:05,723 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:18:55" (3/4) ... [2024-11-19 14:19:05,725 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 14:19:05,726 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:19:05,726 INFO L158 Benchmark]: Toolchain (without parser) took 10459.28ms. Allocated memory was 178.3MB in the beginning and 272.6MB in the end (delta: 94.4MB). Free memory was 148.2MB in the beginning and 130.5MB in the end (delta: 17.7MB). Peak memory consumption was 112.7MB. Max. memory is 16.1GB. [2024-11-19 14:19:05,726 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory was 86.0MB in the beginning and 85.9MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:19:05,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.02ms. Allocated memory is still 178.3MB. Free memory was 148.2MB in the beginning and 129.1MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 14:19:05,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.44ms. Allocated memory is still 178.3MB. Free memory was 129.1MB in the beginning and 128.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:19:05,727 INFO L158 Benchmark]: Boogie Preprocessor took 42.58ms. Allocated memory is still 178.3MB. Free memory was 128.0MB in the beginning and 125.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:19:05,727 INFO L158 Benchmark]: RCFGBuilder took 369.83ms. Allocated memory is still 178.3MB. Free memory was 125.9MB in the beginning and 139.4MB in the end (delta: -13.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 14:19:05,727 INFO L158 Benchmark]: BuchiAutomizer took 9725.51ms. Allocated memory was 178.3MB in the beginning and 272.6MB in the end (delta: 94.4MB). Free memory was 139.4MB in the beginning and 130.5MB in the end (delta: 8.8MB). Peak memory consumption was 106.3MB. Max. memory is 16.1GB. [2024-11-19 14:19:05,727 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 272.6MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:19:05,728 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.14ms. Allocated memory is still 117.4MB. Free memory was 86.0MB in the beginning and 85.9MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.02ms. Allocated memory is still 178.3MB. Free memory was 148.2MB in the beginning and 129.1MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.44ms. Allocated memory is still 178.3MB. Free memory was 129.1MB in the beginning and 128.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.58ms. Allocated memory is still 178.3MB. Free memory was 128.0MB in the beginning and 125.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 369.83ms. Allocated memory is still 178.3MB. Free memory was 125.9MB in the beginning and 139.4MB in the end (delta: -13.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 9725.51ms. Allocated memory was 178.3MB in the beginning and 272.6MB in the end (delta: 94.4MB). Free memory was 139.4MB in the beginning and 130.5MB in the end (delta: 8.8MB). Peak memory consumption was 106.3MB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 272.6MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x~0!base,]]] - 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[~y~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x~0!base,]]] - 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[~y~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (2 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function null and consists of 9 locations. One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 6 locations. One nondeterministic module has affine ranking function null and consists of 6 locations. One nondeterministic module has affine ranking function null and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.6s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 7.5s. Construction of modules took 0.2s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 77 StatesRemovedByMinimization, 6 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 [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 158 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 284 IncrementalHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 103 mSDtfsCounter, 284 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI1 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital189 mio100 ax109 hnf100 lsp90 ukn68 mio100 lsp23 div100 bol104 ite100 ukn100 eq162 hnf92 smp97 dnf190 smp71 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 231ms VariablesStem: 3 VariablesLoop: 6 DisjunctsStem: 3 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 42 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-19 14:19:05,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:05,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE