./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/mcmillan2006.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-lit/mcmillan2006.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45cd9f1eda35cecb580d3b7fe5199506be9e5041f2297c1c3e22e0a862fa68be --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 23:05:16,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 23:05:16,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 23:05:16,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 23:05:16,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 23:05:16,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 23:05:16,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 23:05:16,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 23:05:16,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 23:05:16,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 23:05:16,294 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 23:05:16,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 23:05:16,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 23:05:16,295 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 23:05:16,296 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 23:05:16,296 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 23:05:16,296 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 23:05:16,296 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 23:05:16,297 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 23:05:16,297 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 23:05:16,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 23:05:16,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 23:05:16,298 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 23:05:16,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 23:05:16,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 23:05:16,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 23:05:16,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 23:05:16,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 23:05:16,299 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 23:05:16,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 23:05:16,300 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 23:05:16,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 23:05:16,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 23:05:16,300 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 23:05:16,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 23:05:16,300 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 23:05:16,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 23:05:16,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 23:05:16,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 23:05:16,301 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 23:05:16,301 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45cd9f1eda35cecb580d3b7fe5199506be9e5041f2297c1c3e22e0a862fa68be [2024-11-10 23:05:16,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 23:05:16,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 23:05:16,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 23:05:16,522 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 23:05:16,523 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 23:05:16,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/mcmillan2006.i [2024-11-10 23:05:17,751 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 23:05:17,888 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 23:05:17,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/mcmillan2006.i [2024-11-10 23:05:17,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59574d7c2/4c47a9c5fbb949d8880c888aef39df79/FLAG202b2533d [2024-11-10 23:05:18,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59574d7c2/4c47a9c5fbb949d8880c888aef39df79 [2024-11-10 23:05:18,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 23:05:18,308 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 23:05:18,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 23:05:18,309 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 23:05:18,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 23:05:18,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:05:18" (1/1) ... [2024-11-10 23:05:18,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f2c196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:18, skipping insertion in model container [2024-11-10 23:05:18,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:05:18" (1/1) ... [2024-11-10 23:05:18,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 23:05:18,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:05:18,486 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 23:05:18,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:05:18,554 INFO L204 MainTranslator]: Completed translation [2024-11-10 23:05:18,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:18 WrapperNode [2024-11-10 23:05:18,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 23:05:18,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 23:05:18,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 23:05:18,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 23:05:18,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:18" (1/1) ... [2024-11-10 23:05:18,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:18" (1/1) ... [2024-11-10 23:05:18,586 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2024-11-10 23:05:18,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 23:05:18,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 23:05:18,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 23:05:18,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 23:05:18,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:18" (1/1) ... [2024-11-10 23:05:18,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:18" (1/1) ... [2024-11-10 23:05:18,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:18" (1/1) ... [2024-11-10 23:05:18,610 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-10 23:05:18,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:18" (1/1) ... [2024-11-10 23:05:18,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:18" (1/1) ... [2024-11-10 23:05:18,614 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:18" (1/1) ... [2024-11-10 23:05:18,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:18" (1/1) ... [2024-11-10 23:05:18,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:18" (1/1) ... [2024-11-10 23:05:18,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:18" (1/1) ... [2024-11-10 23:05:18,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 23:05:18,618 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 23:05:18,618 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 23:05:18,619 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 23:05:18,619 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:18" (1/1) ... [2024-11-10 23:05:18,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:18,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:18,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:18,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-10 23:05:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 23:05:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 23:05:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 23:05:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 23:05:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 23:05:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 23:05:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 23:05:18,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 23:05:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 23:05:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 23:05:18,751 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 23:05:18,753 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 23:05:18,861 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 23:05:18,861 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 23:05:18,873 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 23:05:18,873 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 23:05:18,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:05:18 BoogieIcfgContainer [2024-11-10 23:05:18,874 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 23:05:18,875 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 23:05:18,875 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 23:05:18,878 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 23:05:18,879 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:05:18,879 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:05:18" (1/3) ... [2024-11-10 23:05:18,880 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d8be4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:05:18, skipping insertion in model container [2024-11-10 23:05:18,880 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:05:18,881 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:18" (2/3) ... [2024-11-10 23:05:18,881 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d8be4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:05:18, skipping insertion in model container [2024-11-10 23:05:18,881 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:05:18,881 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:05:18" (3/3) ... [2024-11-10 23:05:18,882 INFO L332 chiAutomizerObserver]: Analyzing ICFG mcmillan2006.i [2024-11-10 23:05:18,929 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 23:05:18,930 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 23:05:18,930 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 23:05:18,931 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 23:05:18,931 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 23:05:18,931 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 23:05:18,931 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 23:05:18,931 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 23:05:18,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:18,947 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-10 23:05:18,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:18,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:18,952 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:05:18,952 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 23:05:18,952 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 23:05:18,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:18,954 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-10 23:05:18,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:18,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:18,955 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:05:18,955 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 23:05:18,962 INFO L745 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 12#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~post3#1, main_~i~0#1, main_#t~mem4#1, main_#t~post5#1, main_~i~1#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 13#L28-1true assume !!(0 <= main_~n~0#1 && main_~n~0#1 <= 1000);call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 4294967296);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~i~0#1 := 0; 9#L30-1true [2024-11-10 23:05:18,963 INFO L747 eck$LassoCheckResult]: Loop: 9#L30-1true assume true; 17#L30-3true assume !!(main_~i~0#1 < main_~n~0#1);call write~int#1(0, main_~x~0#1.base, main_~x~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 9#L30-1true [2024-11-10 23:05:18,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:18,969 INFO L85 PathProgramCache]: Analyzing trace with hash 59548, now seen corresponding path program 1 times [2024-11-10 23:05:18,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:18,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336624906] [2024-11-10 23:05:18,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:18,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:19,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:19,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:19,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:19,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1664, now seen corresponding path program 1 times [2024-11-10 23:05:19,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:19,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278384041] [2024-11-10 23:05:19,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:19,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:19,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:19,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:19,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:19,105 INFO L85 PathProgramCache]: Analyzing trace with hash 57226331, now seen corresponding path program 1 times [2024-11-10 23:05:19,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:19,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94595673] [2024-11-10 23:05:19,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:19,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:19,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:19,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:19,403 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:05:19,403 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:05:19,403 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:05:19,404 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:05:19,404 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:05:19,404 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:19,404 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:05:19,404 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:05:19,405 INFO L132 ssoRankerPreferences]: Filename of dumped script: mcmillan2006.i_Iteration1_Lasso [2024-11-10 23:05:19,405 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:05:19,405 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:05:19,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:19,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:19,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:19,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:19,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:19,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:19,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:19,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:19,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:19,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:19,864 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:05:19,868 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:05:19,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:19,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:19,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:19,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-10 23:05:19,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:19,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:19,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:19,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:19,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:19,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 23:05:19,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 23:05:19,896 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:05:19,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:19,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:19,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:19,910 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:19,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-10 23:05:19,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:19,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:19,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:19,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:19,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:19,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 23:05:19,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 23:05:19,929 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:05:19,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-10 23:05:19,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:19,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:19,943 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:19,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-10 23:05:19,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:19,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:19,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:05:19,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:19,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:19,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:19,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:05:19,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:05:19,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:05:19,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-10 23:05:19,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:19,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:19,977 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:19,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-10 23:05:19,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:20,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:20,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:05:20,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:20,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:20,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:20,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:05:20,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:05:20,015 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:05:20,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-10 23:05:20,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:20,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:20,031 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:20,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-10 23:05:20,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:20,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:20,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:20,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:20,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:20,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 23:05:20,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 23:05:20,053 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:05:20,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-10 23:05:20,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:20,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:20,067 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:20,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-10 23:05:20,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:20,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:20,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:20,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:20,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:20,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 23:05:20,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 23:05:20,085 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:05:20,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-10 23:05:20,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:20,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:20,098 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:20,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-10 23:05:20,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:20,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:20,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:20,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:20,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:20,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 23:05:20,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 23:05:20,126 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:05:20,164 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2024-11-10 23:05:20,165 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-11-10 23:05:20,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:20,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:20,189 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:20,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-10 23:05:20,192 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:05:20,204 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-10 23:05:20,204 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:05:20,204 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~x~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~x~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [1*ULTIMATE.start_main_~x~0#1.offset >= 0] [2024-11-10 23:05:20,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-10 23:05:20,234 INFO L156 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2024-11-10 23:05:20,243 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-10 23:05:20,244 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-10 23:05:20,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:20,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 23:05:20,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:20,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 23:05:20,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:20,328 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 23:05:20,329 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:20,371 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 44 transitions. Complement of second has 6 states. [2024-11-10 23:05:20,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 23:05:20,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:20,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-11-10 23:05:20,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 3 letters. Loop has 2 letters. [2024-11-10 23:05:20,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:05:20,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-10 23:05:20,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:05:20,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-10 23:05:20,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:05:20,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2024-11-10 23:05:20,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 23:05:20,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 15 states and 19 transitions. [2024-11-10 23:05:20,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 23:05:20,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-10 23:05:20,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2024-11-10 23:05:20,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:05:20,384 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-10 23:05:20,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2024-11-10 23:05:20,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-10 23:05:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2024-11-10 23:05:20,402 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-10 23:05:20,402 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-10 23:05:20,402 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 23:05:20,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2024-11-10 23:05:20,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 23:05:20,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:20,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:20,403 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-10 23:05:20,403 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 23:05:20,403 INFO L745 eck$LassoCheckResult]: Stem: 114#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 115#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~post3#1, main_~i~0#1, main_#t~mem4#1, main_#t~post5#1, main_~i~1#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 128#L28-1 assume !!(0 <= main_~n~0#1 && main_~n~0#1 <= 1000);call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 4294967296);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~i~0#1 := 0; 124#L30-1 assume true; 126#L30-3 assume !(main_~i~0#1 < main_~n~0#1); 118#L30 havoc main_~i~0#1;main_~i~1#1 := 0; 119#L31-1 [2024-11-10 23:05:20,404 INFO L747 eck$LassoCheckResult]: Loop: 119#L31-1 assume true; 122#L31-3 assume !!(main_~i~1#1 < main_~n~0#1);call main_#t~mem4#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 123#L19 assume !(0 == __VERIFIER_assert_~cond#1); 117#L22 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 119#L31-1 [2024-11-10 23:05:20,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:20,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1774016216, now seen corresponding path program 1 times [2024-11-10 23:05:20,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:20,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252647036] [2024-11-10 23:05:20,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:20,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:20,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:20,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:20,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:20,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1384153, now seen corresponding path program 1 times [2024-11-10 23:05:20,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:20,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636464238] [2024-11-10 23:05:20,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:20,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:20,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:20,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:20,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:20,439 INFO L85 PathProgramCache]: Analyzing trace with hash 185414192, now seen corresponding path program 1 times [2024-11-10 23:05:20,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:20,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612702490] [2024-11-10 23:05:20,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:20,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:20,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:20,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:20,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612702490] [2024-11-10 23:05:20,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612702490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:05:20,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:05:20,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 23:05:20,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290086853] [2024-11-10 23:05:20,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:05:20,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:20,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 23:05:20,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 23:05:20,623 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:20,639 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2024-11-10 23:05:20,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2024-11-10 23:05:20,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 23:05:20,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 13 states and 14 transitions. [2024-11-10 23:05:20,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-10 23:05:20,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-10 23:05:20,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2024-11-10 23:05:20,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:05:20,641 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-10 23:05:20,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2024-11-10 23:05:20,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-10 23:05:20,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-11-10 23:05:20,642 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-10 23:05:20,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 23:05:20,643 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-10 23:05:20,643 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 23:05:20,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2024-11-10 23:05:20,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 23:05:20,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:20,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:20,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-10 23:05:20,643 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 23:05:20,644 INFO L745 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 165#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~post3#1, main_~i~0#1, main_#t~mem4#1, main_#t~post5#1, main_~i~1#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 167#L28-1 assume !!(0 <= main_~n~0#1 && main_~n~0#1 <= 1000);call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 4294967296);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~i~0#1 := 0; 158#L30-1 assume true; 159#L30-3 assume !!(main_~i~0#1 < main_~n~0#1);call write~int#1(0, main_~x~0#1.base, main_~x~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 160#L30-1 assume true; 161#L30-3 assume !(main_~i~0#1 < main_~n~0#1); 166#L30 havoc main_~i~0#1;main_~i~1#1 := 0; 163#L31-1 [2024-11-10 23:05:20,644 INFO L747 eck$LassoCheckResult]: Loop: 163#L31-1 assume true; 168#L31-3 assume !!(main_~i~1#1 < main_~n~0#1);call main_#t~mem4#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 169#L19 assume !(0 == __VERIFIER_assert_~cond#1); 162#L22 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 163#L31-1 [2024-11-10 23:05:20,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:20,644 INFO L85 PathProgramCache]: Analyzing trace with hash -272367943, now seen corresponding path program 1 times [2024-11-10 23:05:20,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:20,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660553776] [2024-11-10 23:05:20,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:20,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:20,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:20,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:20,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:20,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1384153, now seen corresponding path program 2 times [2024-11-10 23:05:20,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:20,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459405896] [2024-11-10 23:05:20,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:20,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:20,676 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:20,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:20,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:20,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1540030865, now seen corresponding path program 1 times [2024-11-10 23:05:20,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:20,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69192489] [2024-11-10 23:05:20,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:20,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:20,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:20,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:20,938 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:05:20,938 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:05:20,938 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:05:20,938 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:05:20,938 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:05:20,938 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:20,938 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:05:20,938 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:05:20,938 INFO L132 ssoRankerPreferences]: Filename of dumped script: mcmillan2006.i_Iteration3_Lasso [2024-11-10 23:05:20,939 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:05:20,939 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:05:20,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:20,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:20,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:20,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:21,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:21,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:21,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:21,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:21,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:21,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:21,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:21,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:21,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:21,295 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:05:21,295 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:05:21,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:21,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:21,297 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:21,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-10 23:05:21,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:21,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:21,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:05:21,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:21,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:21,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:21,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:05:21,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:05:21,311 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:05:21,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-10 23:05:21,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:21,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:21,323 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:21,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-10 23:05:21,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:21,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:21,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:05:21,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:21,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:21,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:21,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:05:21,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:05:21,337 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:05:21,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-10 23:05:21,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:21,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:21,349 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:21,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-10 23:05:21,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:21,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:21,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:21,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:21,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:21,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 23:05:21,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 23:05:21,367 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:05:21,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-10 23:05:21,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:21,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:21,379 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:21,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-10 23:05:21,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:21,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:21,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:21,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:21,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:21,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 23:05:21,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 23:05:21,394 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:05:21,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-10 23:05:21,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:21,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:21,407 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:21,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-10 23:05:21,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:21,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:21,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:21,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:21,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:21,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 23:05:21,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 23:05:21,428 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:05:21,441 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-10 23:05:21,441 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-11-10 23:05:21,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:21,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:21,443 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:21,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-10 23:05:21,444 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:05:21,455 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 23:05:21,455 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:05:21,455 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2024-11-10 23:05:21,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:21,472 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-10 23:05:21,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:21,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:05:21,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:21,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:05:21,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:21,518 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 23:05:21,518 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:21,531 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 16 states and 18 transitions. Complement of second has 6 states. [2024-11-10 23:05:21,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:05:21,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2024-11-10 23:05:21,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 4 letters. [2024-11-10 23:05:21,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:05:21,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 12 letters. Loop has 4 letters. [2024-11-10 23:05:21,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:05:21,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 8 letters. [2024-11-10 23:05:21,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:05:21,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2024-11-10 23:05:21,534 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 23:05:21,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2024-11-10 23:05:21,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-10 23:05:21,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-10 23:05:21,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-10 23:05:21,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:21,534 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 23:05:21,534 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 23:05:21,534 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 23:05:21,534 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 23:05:21,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-10 23:05:21,535 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 23:05:21,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-10 23:05:21,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:05:21 BoogieIcfgContainer [2024-11-10 23:05:21,541 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 23:05:21,542 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 23:05:21,542 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 23:05:21,542 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 23:05:21,542 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:05:18" (3/4) ... [2024-11-10 23:05:21,544 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 23:05:21,544 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 23:05:21,546 INFO L158 Benchmark]: Toolchain (without parser) took 3236.84ms. Allocated memory is still 178.3MB. Free memory was 108.9MB in the beginning and 101.4MB in the end (delta: 7.5MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2024-11-10 23:05:21,546 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 68.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:05:21,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.85ms. Allocated memory is still 178.3MB. Free memory was 108.7MB in the beginning and 150.0MB in the end (delta: -41.3MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2024-11-10 23:05:21,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.61ms. Allocated memory is still 178.3MB. Free memory was 149.7MB in the beginning and 148.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:05:21,547 INFO L158 Benchmark]: Boogie Preprocessor took 29.59ms. Allocated memory is still 178.3MB. Free memory was 148.3MB in the beginning and 146.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 23:05:21,547 INFO L158 Benchmark]: IcfgBuilder took 255.86ms. Allocated memory is still 178.3MB. Free memory was 146.2MB in the beginning and 134.4MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 23:05:21,547 INFO L158 Benchmark]: BuchiAutomizer took 2666.43ms. Allocated memory is still 178.3MB. Free memory was 134.4MB in the beginning and 102.3MB in the end (delta: 32.1MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2024-11-10 23:05:21,548 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 178.3MB. Free memory was 102.3MB in the beginning and 101.4MB in the end (delta: 939.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:05:21,549 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.13ms. Allocated memory is still 104.9MB. Free memory is still 68.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.85ms. Allocated memory is still 178.3MB. Free memory was 108.7MB in the beginning and 150.0MB in the end (delta: -41.3MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.61ms. Allocated memory is still 178.3MB. Free memory was 149.7MB in the beginning and 148.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.59ms. Allocated memory is still 178.3MB. Free memory was 148.3MB in the beginning and 146.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 255.86ms. Allocated memory is still 178.3MB. Free memory was 146.2MB in the beginning and 134.4MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 2666.43ms. Allocated memory is still 178.3MB. Free memory was 134.4MB in the beginning and 102.3MB in the end (delta: 32.1MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 178.3MB. Free memory was 102.3MB in the beginning and 101.4MB in the end (delta: 939.7kB). 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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function (n + ((long long) -1 * i)) and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 27 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital136 mio100 ax100 hnf100 lsp89 ukn77 mio100 lsp44 div140 bol100 ite100 ukn100 eq149 hnf93 smp85 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-10 23:05:21,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-10 23:05:21,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE