./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-alloca-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-12 00:17:44,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:17:44,404 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-12 00:17:44,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:17:44,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:17:44,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:17:44,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:17:44,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:17:44,444 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:17:44,444 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:17:44,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:17:44,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:17:44,445 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:17:44,445 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:17:44,446 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:17:44,446 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:17:44,446 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:17:44,446 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:17:44,447 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:17:44,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:17:44,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:17:44,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:17:44,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:17:44,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:17:44,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:17:44,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:17:44,452 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:17:44,452 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:17:44,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:17:44,452 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:17:44,453 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:17:44,453 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:17:44,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:17:44,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:17:44,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:17:44,458 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:17:44,458 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-clean/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-clean/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-10-12 00:17:44,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:17:44,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:17:44,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:17:44,718 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:17:44,719 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:17:44,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-alloca-2.i [2024-10-12 00:17:46,209 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:17:46,410 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:17:46,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-alloca-2.i [2024-10-12 00:17:46,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8ff562a71/057132df08e64435b6f6d2566979e868/FLAG1d37d9936 [2024-10-12 00:17:46,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8ff562a71/057132df08e64435b6f6d2566979e868 [2024-10-12 00:17:46,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:17:46,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:17:46,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:17:46,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:17:46,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:17:46,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:17:46" (1/1) ... [2024-10-12 00:17:46,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2688d3f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:46, skipping insertion in model container [2024-10-12 00:17:46,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:17:46" (1/1) ... [2024-10-12 00:17:46,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:17:47,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:17:47,094 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:17:47,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:17:47,174 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:17:47,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:47 WrapperNode [2024-10-12 00:17:47,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:17:47,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:17:47,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:17:47,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:17:47,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:47" (1/1) ... [2024-10-12 00:17:47,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:47" (1/1) ... [2024-10-12 00:17:47,239 INFO L138 Inliner]: procedures = 110, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2024-10-12 00:17:47,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:17:47,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:17:47,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:17:47,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:17:47,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:47" (1/1) ... [2024-10-12 00:17:47,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:47" (1/1) ... [2024-10-12 00:17:47,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:47" (1/1) ... [2024-10-12 00:17:47,269 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-10-12 00:17:47,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:47" (1/1) ... [2024-10-12 00:17:47,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:47" (1/1) ... [2024-10-12 00:17:47,273 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:47" (1/1) ... [2024-10-12 00:17:47,275 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:47" (1/1) ... [2024-10-12 00:17:47,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:47" (1/1) ... [2024-10-12 00:17:47,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:47" (1/1) ... [2024-10-12 00:17:47,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:17:47,280 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:17:47,280 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:17:47,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:17:47,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:47" (1/1) ... [2024-10-12 00:17:47,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:47,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:47,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:47,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:17:47,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:17:47,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 00:17:47,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:17:47,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 00:17:47,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:17:47,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:17:47,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:17:47,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:17:47,451 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:17:47,454 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:17:47,585 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-12 00:17:47,585 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:17:47,596 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:17:47,596 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 00:17:47,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:17:47 BoogieIcfgContainer [2024-10-12 00:17:47,597 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:17:47,598 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:17:47,598 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:17:47,602 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:17:47,603 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:17:47,603 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:17:46" (1/3) ... [2024-10-12 00:17:47,604 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e9fb571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:17:47, skipping insertion in model container [2024-10-12 00:17:47,604 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:17:47,604 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:47" (2/3) ... [2024-10-12 00:17:47,604 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e9fb571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:17:47, skipping insertion in model container [2024-10-12 00:17:47,605 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:17:47,605 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:17:47" (3/3) ... [2024-10-12 00:17:47,606 INFO L332 chiAutomizerObserver]: Analyzing ICFG Urban-alloca-2.i [2024-10-12 00:17:47,673 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:17:47,673 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:17:47,673 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:17:47,673 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:17:47,673 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:17:47,673 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:17:47,673 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:17:47,674 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:17:47,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:47,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-12 00:17:47,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:17:47,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:17:47,724 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:17:47,724 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:17:47,725 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:17:47,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:47,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-12 00:17:47,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:17:47,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:17:47,727 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:17:47,727 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:17:47,734 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-10-12 00:17:47,735 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-10-12 00:17:47,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:47,746 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:17:47,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:47,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710268423] [2024-10-12 00:17:47,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:47,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:47,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:47,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:47,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:47,915 INFO L85 PathProgramCache]: Analyzing trace with hash 35409937, now seen corresponding path program 1 times [2024-10-12 00:17:47,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:47,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810166892] [2024-10-12 00:17:47,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:47,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:47,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:47,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:47,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:47,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849423, now seen corresponding path program 1 times [2024-10-12 00:17:47,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:47,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719290322] [2024-10-12 00:17:47,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:47,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:47,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:48,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:48,467 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:17:48,468 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:17:48,468 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:17:48,468 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:17:48,469 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:17:48,469 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:48,469 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:17:48,469 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:17:48,469 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration1_Lasso [2024-10-12 00:17:48,469 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:17:48,470 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:17:48,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:49,063 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:17:49,067 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:17:49,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:49,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:49,071 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:49,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:17:49,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:49,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:49,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:49,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:49,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:49,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:49,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:49,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:49,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:49,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:49,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:49,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:49,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:49,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:17:49,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:49,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:49,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:49,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:49,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:49,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:49,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:49,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:49,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:49,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:49,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:49,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:49,162 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:49,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:17:49,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:49,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:49,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:49,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:49,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:49,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:49,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:49,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:49,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:49,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:17:49,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:49,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:49,240 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:49,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:17:49,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:49,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:49,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:49,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:49,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:49,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:49,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:49,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:49,266 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:49,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:49,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:49,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:49,279 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:49,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:17:49,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:49,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:49,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:49,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:49,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:49,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:49,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:49,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:49,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:49,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 00:17:49,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:49,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:49,310 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:49,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:17:49,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:49,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:49,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:49,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:49,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:49,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:49,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:49,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:49,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:49,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:17:49,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:49,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:49,341 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:49,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:17:49,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:49,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:49,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:49,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:49,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:49,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:49,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:49,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:49,356 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:49,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:49,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:49,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:49,372 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:49,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:17:49,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:49,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:49,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:49,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:49,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:49,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:49,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:49,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:49,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-12 00:17:49,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:49,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:49,414 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:49,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:17:49,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:49,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:49,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:49,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:49,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:49,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:49,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:49,446 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:17:49,472 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-12 00:17:49,473 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-12 00:17:49,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:49,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:49,476 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:49,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:17:49,479 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:17:49,492 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:17:49,493 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:17:49,493 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-10-12 00:17:49,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:49,534 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2024-10-12 00:17:49,542 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-12 00:17:49,543 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-12 00:17:49,543 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2024-10-12 00:17:49,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:49,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:17:49,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:49,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 00:17:49,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:49,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:49,757 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-10-12 00:17:49,759 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-10-12 00:17:49,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 00:17:49,972 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-10-12 00:17:49,977 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-10-12 00:17:49,981 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-10-12 00:17:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2024-10-12 00:17:49,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 2 letters. Loop has 5 letters. [2024-10-12 00:17:49,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:49,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 7 letters. Loop has 5 letters. [2024-10-12 00:17:49,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:49,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 2 letters. Loop has 10 letters. [2024-10-12 00:17:49,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:49,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 71 transitions. [2024-10-12 00:17:49,989 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-12 00:17:49,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 26 states and 37 transitions. [2024-10-12 00:17:49,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-10-12 00:17:49,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-12 00:17:49,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2024-10-12 00:17:49,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:17:49,997 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 37 transitions. [2024-10-12 00:17:50,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2024-10-12 00:17:50,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-10-12 00:17:50,020 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-10-12 00:17:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2024-10-12 00:17:50,021 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2024-10-12 00:17:50,022 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2024-10-12 00:17:50,022 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:17:50,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2024-10-12 00:17:50,023 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-12 00:17:50,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:17:50,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:17:50,023 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:17:50,023 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:17:50,023 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-10-12 00:17:50,024 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-10-12 00:17:50,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:50,024 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2024-10-12 00:17:50,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:50,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163822098] [2024-10-12 00:17:50,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:50,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:50,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:50,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:50,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:50,060 INFO L85 PathProgramCache]: Analyzing trace with hash 45903353, now seen corresponding path program 1 times [2024-10-12 00:17:50,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:50,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081120851] [2024-10-12 00:17:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:50,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:50,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:50,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:50,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:50,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1272522354, now seen corresponding path program 1 times [2024-10-12 00:17:50,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:50,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625948774] [2024-10-12 00:17:50,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:50,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:50,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:17:50,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625948774] [2024-10-12 00:17:50,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625948774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:17:50,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:17:50,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:17:50,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425353299] [2024-10-12 00:17:50,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:17:50,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:17:50,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:17:50,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:17:50,343 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-10-12 00:17:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:17:50,356 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2024-10-12 00:17:50,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2024-10-12 00:17:50,357 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-12 00:17:50,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 32 transitions. [2024-10-12 00:17:50,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-10-12 00:17:50,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-10-12 00:17:50,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2024-10-12 00:17:50,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:17:50,361 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 32 transitions. [2024-10-12 00:17:50,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2024-10-12 00:17:50,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-10-12 00:17:50,363 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-10-12 00:17:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2024-10-12 00:17:50,364 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-10-12 00:17:50,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:17:50,365 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-10-12 00:17:50,366 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:17:50,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2024-10-12 00:17:50,367 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-12 00:17:50,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:17:50,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:17:50,368 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 00:17:50,369 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:17:50,369 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-10-12 00:17:50,369 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-10-12 00:17:50,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:50,370 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-10-12 00:17:50,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:50,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055600986] [2024-10-12 00:17:50,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:50,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:50,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:50,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:50,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:50,411 INFO L85 PathProgramCache]: Analyzing trace with hash 38421593, now seen corresponding path program 2 times [2024-10-12 00:17:50,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:50,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697292811] [2024-10-12 00:17:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:50,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:50,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:50,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:50,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:50,435 INFO L85 PathProgramCache]: Analyzing trace with hash 177749398, now seen corresponding path program 1 times [2024-10-12 00:17:50,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:50,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788427360] [2024-10-12 00:17:50,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:50,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:50,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:50,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:50,881 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:17:50,881 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:17:50,881 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:17:50,881 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:17:50,881 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:17:50,881 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:50,882 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:17:50,882 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:17:50,882 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration3_Lasso [2024-10-12 00:17:50,882 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:17:50,882 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:17:50,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:50,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,361 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:17:51,362 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:17:51,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:51,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:51,363 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:51,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:17:51,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:51,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:51,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:51,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:51,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:51,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:51,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:51,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:51,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:51,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:51,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:51,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:51,395 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:51,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:17:51,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:51,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:51,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:51,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:51,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:51,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:51,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:51,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:51,411 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:17:51,417 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:17:51,418 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:17:51,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:51,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:51,420 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:51,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:17:51,422 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:17:51,422 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:17:51,422 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:17:51,422 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-10-12 00:17:51,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:51,455 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2024-10-12 00:17:51,456 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:17:51,456 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:17:51,457 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y~0!base,]]] [2024-10-12 00:17:51,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:51,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:17:51,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:51,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:17:51,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:51,606 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-10-12 00:17:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:51,621 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-10-12 00:17:51,622 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-10-12 00:17:51,664 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-10-12 00:17:51,664 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-10-12 00:17:51,665 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-10-12 00:17:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2024-10-12 00:17:51,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 3 letters. Loop has 5 letters. [2024-10-12 00:17:51,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:51,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 5 letters. [2024-10-12 00:17:51,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:51,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 3 letters. Loop has 10 letters. [2024-10-12 00:17:51,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:51,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 77 transitions. [2024-10-12 00:17:51,668 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-12 00:17:51,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 59 states and 75 transitions. [2024-10-12 00:17:51,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-12 00:17:51,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-10-12 00:17:51,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 75 transitions. [2024-10-12 00:17:51,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:17:51,669 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 75 transitions. [2024-10-12 00:17:51,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 75 transitions. [2024-10-12 00:17:51,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2024-10-12 00:17:51,672 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-10-12 00:17:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2024-10-12 00:17:51,673 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 62 transitions. [2024-10-12 00:17:51,673 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2024-10-12 00:17:51,673 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:17:51,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 62 transitions. [2024-10-12 00:17:51,673 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-12 00:17:51,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:17:51,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:17:51,674 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:17:51,674 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:17:51,674 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-10-12 00:17:51,674 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-10-12 00:17:51,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:51,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849167, now seen corresponding path program 1 times [2024-10-12 00:17:51,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:51,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007499912] [2024-10-12 00:17:51,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:51,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:51,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:51,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:51,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:51,697 INFO L85 PathProgramCache]: Analyzing trace with hash 35409681, now seen corresponding path program 1 times [2024-10-12 00:17:51,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:51,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5850404] [2024-10-12 00:17:51,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:51,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:51,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:51,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:51,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1594794819, now seen corresponding path program 2 times [2024-10-12 00:17:51,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:51,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090975651] [2024-10-12 00:17:51,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:51,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:51,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:51,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:52,132 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:17:52,132 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:17:52,132 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:17:52,132 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:17:52,132 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:17:52,132 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,132 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:17:52,132 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:17:52,132 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration4_Lasso [2024-10-12 00:17:52,133 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:17:52,133 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:17:52,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:52,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:52,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:52,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:52,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 00:17:52,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:52,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:52,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:52,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:52,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:52,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:52,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:52,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:52,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:52,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:52,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:52,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:52,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:52,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:52,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:52,570 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:17:52,570 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:17:52,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,573 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:52,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:17:52,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:52,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:52,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:52,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:52,590 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:52,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,604 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:52,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:17:52,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:52,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:52,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:52,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:52,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:52,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,632 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:52,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:17:52,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:52,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:52,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:52,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:52,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:52,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,668 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:52,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:17:52,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:52,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:52,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:52,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-12 00:17:52,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,707 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:52,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:17:52,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-10-12 00:17:52,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:52,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:52,735 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:17:52,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,753 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:52,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:17:52,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:52,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:52,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:52,783 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:52,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,800 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:52,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:17:52,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:52,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:52,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:52,821 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-12 00:17:52,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,835 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:52,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:17:52,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:52,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,849 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:52,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:52,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-12 00:17:52,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,865 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:52,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:17:52,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:52,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:52,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:52,881 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-12 00:17:52,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,894 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:52,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:17:52,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:52,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,908 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:52,908 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:52,912 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:17:52,916 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-10-12 00:17:52,916 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-10-12 00:17:52,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,918 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:52,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 00:17:52,919 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:17:52,932 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:17:52,932 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:17:52,932 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-10-12 00:17:52,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-12 00:17:52,967 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2024-10-12 00:17:52,968 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-12 00:17:52,968 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-12 00:17:52,968 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2024-10-12 00:17:52,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:53,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:17:53,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:53,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:17:53,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:53,055 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-12 00:17:53,055 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-10-12 00:17:53,125 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-10-12 00:17:53,126 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-10-12 00:17:53,126 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-10-12 00:17:53,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2024-10-12 00:17:53,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 7 letters. Loop has 5 letters. [2024-10-12 00:17:53,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:53,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 12 letters. Loop has 5 letters. [2024-10-12 00:17:53,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:53,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 7 letters. Loop has 10 letters. [2024-10-12 00:17:53,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:53,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 91 transitions. [2024-10-12 00:17:53,128 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-10-12 00:17:53,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 66 states and 89 transitions. [2024-10-12 00:17:53,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-10-12 00:17:53,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-10-12 00:17:53,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 89 transitions. [2024-10-12 00:17:53,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:17:53,129 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 89 transitions. [2024-10-12 00:17:53,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 89 transitions. [2024-10-12 00:17:53,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2024-10-12 00:17:53,135 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-10-12 00:17:53,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2024-10-12 00:17:53,135 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 78 transitions. [2024-10-12 00:17:53,135 INFO L425 stractBuchiCegarLoop]: Abstraction has 58 states and 78 transitions. [2024-10-12 00:17:53,135 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:17:53,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 78 transitions. [2024-10-12 00:17:53,136 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-10-12 00:17:53,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:17:53,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:17:53,136 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-12 00:17:53,136 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:17:53,137 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-10-12 00:17:53,137 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-10-12 00:17:53,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:53,137 INFO L85 PathProgramCache]: Analyzing trace with hash 177749336, now seen corresponding path program 3 times [2024-10-12 00:17:53,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:53,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824039805] [2024-10-12 00:17:53,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:53,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:53,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:53,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:53,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:53,175 INFO L85 PathProgramCache]: Analyzing trace with hash 38421593, now seen corresponding path program 3 times [2024-10-12 00:17:53,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:53,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280190146] [2024-10-12 00:17:53,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:53,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:53,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:53,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:53,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:53,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2100968094, now seen corresponding path program 1 times [2024-10-12 00:17:53,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:53,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890366904] [2024-10-12 00:17:53,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:53,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:53,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:53,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:53,765 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:17:53,765 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:17:53,765 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:17:53,765 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:17:53,765 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:17:53,765 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:53,765 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:17:53,765 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:17:53,765 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration5_Lasso [2024-10-12 00:17:53,765 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:17:53,765 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:17:53,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:53,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:53,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:53,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:53,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:53,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:53,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:53,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:53,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:53,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:53,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:53,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:53,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:54,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:54,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:54,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:54,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:54,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:54,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:54,213 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:17:54,214 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:17:54,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:54,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:54,218 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:54,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 00:17:54,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:54,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:54,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:54,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:54,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:54,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:54,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:54,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:54,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-10-12 00:17:54,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:54,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:54,269 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:54,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 00:17:54,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:54,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:54,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:54,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:54,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:54,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:54,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:54,302 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:54,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-12 00:17:54,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:54,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:54,324 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:54,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:17:54,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:54,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:54,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:54,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:54,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:54,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:54,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:54,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:54,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-12 00:17:54,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:54,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:54,381 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:54,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 00:17:54,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:54,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:54,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:54,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:54,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:54,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:54,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:54,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:54,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-12 00:17:54,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:54,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:54,432 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:54,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:17:54,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:54,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:54,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:54,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:54,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:54,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:54,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:54,467 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:54,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-12 00:17:54,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:54,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:54,488 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:54,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-12 00:17:54,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:54,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:54,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:54,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:54,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:54,505 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:54,505 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:54,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:54,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-12 00:17:54,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:54,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:54,520 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:54,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-12 00:17:54,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:54,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:54,532 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-12 00:17:54,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:54,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:54,534 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-10-12 00:17:54,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:54,538 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:54,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:54,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:54,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:54,551 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:54,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-12 00:17:54,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:54,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:54,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:54,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:54,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:54,565 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:54,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:54,570 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:17:54,575 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-10-12 00:17:54,575 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-10-12 00:17:54,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:54,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:54,577 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:54,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-12 00:17:54,578 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:17:54,589 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:17:54,589 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:17:54,589 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-10-12 00:17:54,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:54,623 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2024-10-12 00:17:54,625 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:17:54,625 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:17:54,625 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y~0!base,]]] [2024-10-12 00:17:54,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:54,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:17:54,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:54,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:17:54,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:54,757 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-10-12 00:17:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:54,773 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-10-12 00:17:54,773 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-10-12 00:17:54,819 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-10-12 00:17:54,819 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-10-12 00:17:54,820 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-10-12 00:17:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2024-10-12 00:17:54,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 8 letters. Loop has 5 letters. [2024-10-12 00:17:54,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:54,820 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:17:54,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:54,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:17:54,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:54,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:17:54,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:54,938 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-10-12 00:17:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:54,954 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-10-12 00:17:54,954 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-10-12 00:17:55,014 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-10-12 00:17:55,014 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-10-12 00:17:55,015 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-10-12 00:17:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-10-12 00:17:55,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 8 letters. Loop has 5 letters. [2024-10-12 00:17:55,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:55,015 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:17:55,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:55,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-12 00:17:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:55,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:17:55,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:55,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:17:55,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:55,182 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-10-12 00:17:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:55,195 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-10-12 00:17:55,195 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-10-12 00:17:55,255 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-10-12 00:17:55,255 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-10-12 00:17:55,256 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-10-12 00:17:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-10-12 00:17:55,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 8 letters. Loop has 5 letters. [2024-10-12 00:17:55,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:55,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 13 letters. Loop has 5 letters. [2024-10-12 00:17:55,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:55,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 8 letters. Loop has 10 letters. [2024-10-12 00:17:55,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:55,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 182 transitions. [2024-10-12 00:17:55,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2024-10-12 00:17:55,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 94 states and 119 transitions. [2024-10-12 00:17:55,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-10-12 00:17:55,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-10-12 00:17:55,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 119 transitions. [2024-10-12 00:17:55,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:17:55,263 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94 states and 119 transitions. [2024-10-12 00:17:55,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 119 transitions. [2024-10-12 00:17:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 76. [2024-10-12 00:17:55,267 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-10-12 00:17:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2024-10-12 00:17:55,267 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 101 transitions. [2024-10-12 00:17:55,267 INFO L425 stractBuchiCegarLoop]: Abstraction has 76 states and 101 transitions. [2024-10-12 00:17:55,268 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:17:55,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 101 transitions. [2024-10-12 00:17:55,268 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-10-12 00:17:55,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:17:55,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:17:55,269 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-12 00:17:55,269 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:17:55,269 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-10-12 00:17:55,269 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-10-12 00:17:55,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:55,269 INFO L85 PathProgramCache]: Analyzing trace with hash 177757334, now seen corresponding path program 1 times [2024-10-12 00:17:55,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:55,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82602809] [2024-10-12 00:17:55,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:55,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:55,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:55,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:55,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:55,289 INFO L85 PathProgramCache]: Analyzing trace with hash 38429467, now seen corresponding path program 2 times [2024-10-12 00:17:55,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:55,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798961156] [2024-10-12 00:17:55,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:55,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:55,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:55,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:55,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:55,300 INFO L85 PathProgramCache]: Analyzing trace with hash -758277210, now seen corresponding path program 1 times [2024-10-12 00:17:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:55,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843815926] [2024-10-12 00:17:55,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:55,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:55,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:55,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:55,828 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:17:55,828 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:17:55,828 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:17:55,828 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:17:55,828 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:17:55,828 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:55,828 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:17:55,828 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:17:55,828 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration6_Lasso [2024-10-12 00:17:55,828 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:17:55,828 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:17:55,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,390 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:17:56,390 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:17:56,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:56,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:56,393 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:56,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-12 00:17:56,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:56,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:56,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:56,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:56,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:56,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:56,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:56,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:56,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-10-12 00:17:56,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:56,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:56,425 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:56,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-12 00:17:56,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:56,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:56,440 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-10-12 00:17:56,440 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2024-10-12 00:17:56,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:56,459 INFO L401 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2024-10-12 00:17:56,459 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2024-10-12 00:17:56,501 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:17:56,543 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-12 00:17:56,544 INFO L444 ModelExtractionUtils]: 10 out of 29 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-10-12 00:17:56,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:56,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:56,545 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:17:56,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-12 00:17:56,546 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:17:56,560 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2024-10-12 00:17:56,561 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:17:56,561 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-10-12 00:17:56,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-10-12 00:17:56,602 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2024-10-12 00:17:56,603 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-12 00:17:56,603 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-12 00:17:56,604 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2024-10-12 00:17:56,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:56,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:17:56,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:56,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:17:56,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:56,673 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-10-12 00:17:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:56,688 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-10-12 00:17:56,688 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-10-12 00:17:56,722 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-10-12 00:17:56,724 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-10-12 00:17:56,725 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-10-12 00:17:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2024-10-12 00:17:56,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 5 letters. [2024-10-12 00:17:56,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:56,725 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:17:56,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:56,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:17:56,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:56,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:17:56,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:56,801 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-10-12 00:17:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:56,813 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-10-12 00:17:56,814 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-10-12 00:17:56,852 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-10-12 00:17:56,853 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-10-12 00:17:56,853 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-10-12 00:17:56,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2024-10-12 00:17:56,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 8 letters. Loop has 5 letters. [2024-10-12 00:17:56,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:56,854 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:17:56,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:56,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:17:56,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:56,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:17:56,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:56,920 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-10-12 00:17:56,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:56,936 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-10-12 00:17:56,936 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-10-12 00:17:56,965 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-10-12 00:17:56,970 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-10-12 00:17:56,971 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-10-12 00:17:56,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2024-10-12 00:17:56,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 5 letters. [2024-10-12 00:17:56,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:56,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 13 letters. Loop has 5 letters. [2024-10-12 00:17:56,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:56,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 10 letters. [2024-10-12 00:17:56,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:56,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 220 transitions. [2024-10-12 00:17:56,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2024-10-12 00:17:56,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 126 states and 168 transitions. [2024-10-12 00:17:56,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-10-12 00:17:56,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-10-12 00:17:56,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 168 transitions. [2024-10-12 00:17:56,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:17:56,976 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 168 transitions. [2024-10-12 00:17:56,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 168 transitions. [2024-10-12 00:17:56,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2024-10-12 00:17:56,981 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-10-12 00:17:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2024-10-12 00:17:56,981 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-10-12 00:17:56,981 INFO L425 stractBuchiCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-10-12 00:17:56,981 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:17:56,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 129 transitions. [2024-10-12 00:17:56,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2024-10-12 00:17:56,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:17:56,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:17:56,983 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-12 00:17:56,983 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2024-10-12 00:17:56,983 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-10-12 00:17:56,983 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-10-12 00:17:56,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:56,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2100960220, now seen corresponding path program 1 times [2024-10-12 00:17:56,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:56,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111482991] [2024-10-12 00:17:56,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:56,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:57,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:17:57,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111482991] [2024-10-12 00:17:57,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111482991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:17:57,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:17:57,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 00:17:57,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247382196] [2024-10-12 00:17:57,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:17:57,160 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:17:57,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:57,160 INFO L85 PathProgramCache]: Analyzing trace with hash 338206529, now seen corresponding path program 1 times [2024-10-12 00:17:57,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:57,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810408001] [2024-10-12 00:17:57,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:57,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:57,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:17:57,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810408001] [2024-10-12 00:17:57,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810408001] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:17:57,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415657293] [2024-10-12 00:17:57,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:57,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:17:57,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:57,273 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:17:57,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-10-12 00:17:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:57,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 00:17:57,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:57,364 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-10-12 00:17:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:57,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:17:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:57,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415657293] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:17:57,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:17:57,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-12 00:17:57,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738077461] [2024-10-12 00:17:57,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:17:57,455 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:17:57,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:17:57,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 00:17:57,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-12 00:17:57,479 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-10-12 00:17:57,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-10-12 00:17:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:17:57,540 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2024-10-12 00:17:57,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 100 transitions. [2024-10-12 00:17:57,541 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:17:57,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 0 states and 0 transitions. [2024-10-12 00:17:57,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:17:57,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:17:57,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:17:57,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:17:57,541 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:17:57,541 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:17:57,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 00:17:57,543 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:17:57,543 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:17:57,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:17:57,543 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:17:57,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:17:57,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:17:57 BoogieIcfgContainer [2024-10-12 00:17:57,550 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:17:57,550 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:17:57,550 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:17:57,550 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:17:57,551 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:17:47" (3/4) ... [2024-10-12 00:17:57,552 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:17:57,553 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:17:57,553 INFO L158 Benchmark]: Toolchain (without parser) took 10770.30ms. Allocated memory was 195.0MB in the beginning and 302.0MB in the end (delta: 107.0MB). Free memory was 127.0MB in the beginning and 257.1MB in the end (delta: -130.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:17:57,554 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 113.2MB. Free memory is still 79.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:17:57,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.04ms. Allocated memory is still 195.0MB. Free memory was 126.8MB in the beginning and 164.5MB in the end (delta: -37.7MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2024-10-12 00:17:57,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.06ms. Allocated memory is still 195.0MB. Free memory was 164.5MB in the beginning and 163.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:17:57,554 INFO L158 Benchmark]: Boogie Preprocessor took 38.98ms. Allocated memory is still 195.0MB. Free memory was 163.1MB in the beginning and 161.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:17:57,554 INFO L158 Benchmark]: RCFGBuilder took 317.35ms. Allocated memory is still 195.0MB. Free memory was 161.0MB in the beginning and 148.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 00:17:57,554 INFO L158 Benchmark]: BuchiAutomizer took 9951.60ms. Allocated memory was 195.0MB in the beginning and 302.0MB in the end (delta: 107.0MB). Free memory was 147.7MB in the beginning and 257.1MB in the end (delta: -109.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:17:57,555 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 302.0MB. Free memory is still 257.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:17:57,556 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.08ms. Allocated memory is still 113.2MB. Free memory is still 79.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.04ms. Allocated memory is still 195.0MB. Free memory was 126.8MB in the beginning and 164.5MB in the end (delta: -37.7MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.06ms. Allocated memory is still 195.0MB. Free memory was 164.5MB in the beginning and 163.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.98ms. Allocated memory is still 195.0MB. Free memory was 163.1MB in the beginning and 161.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 317.35ms. Allocated memory is still 195.0MB. Free memory was 161.0MB in the beginning and 148.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 9951.60ms. Allocated memory was 195.0MB in the beginning and 302.0MB in the end (delta: 107.0MB). Free memory was 147.7MB in the beginning and 257.1MB in the end (delta: -109.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 302.0MB. Free memory is still 257.1MB. 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.8s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 7.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.6s. 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: 136ms 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-10-12 00:17:57,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:57,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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