./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/Urban-2013WST-Fig2-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 041376d57652038a5d4ee57a004231861ab6efac51c30f8b6c72783e60a27529 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:37:42,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:37:42,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-10 22:37:42,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:37:42,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:37:42,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 22:37:42,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:37:42,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:37:42,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:37:42,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:37:42,745 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:37:42,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:37:42,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:37:42,747 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:37:42,748 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 22:37:42,748 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 22:37:42,749 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 22:37:42,749 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 22:37:42,749 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 22:37:42,750 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 22:37:42,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:37:42,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 22:37:42,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:37:42,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:37:42,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 22:37:42,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 22:37:42,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 22:37:42,753 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:37:42,753 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:37:42,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:37:42,754 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 22:37:42,755 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:37:42,755 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:37:42,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:37:42,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:37:42,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:37:42,757 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 22:37:42,757 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 041376d57652038a5d4ee57a004231861ab6efac51c30f8b6c72783e60a27529 [2024-11-10 22:37:43,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:37:43,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:37:43,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:37:43,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:37:43,082 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:37:43,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca-2.i [2024-11-10 22:37:44,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:37:44,760 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:37:44,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca-2.i [2024-11-10 22:37:44,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964492349/a7c49894752a4e4e937e17ba782f6b74/FLAG9cc47951e [2024-11-10 22:37:44,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964492349/a7c49894752a4e4e937e17ba782f6b74 [2024-11-10 22:37:44,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:37:44,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:37:44,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:37:44,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:37:44,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:37:44,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:37:44" (1/1) ... [2024-11-10 22:37:44,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79339b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:44, skipping insertion in model container [2024-11-10 22:37:44,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:37:44" (1/1) ... [2024-11-10 22:37:44,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:37:45,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:37:45,191 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:37:45,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:37:45,275 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:37:45,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:45 WrapperNode [2024-11-10 22:37:45,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:37:45,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:37:45,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:37:45,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:37:45,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:45" (1/1) ... [2024-11-10 22:37:45,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:45" (1/1) ... [2024-11-10 22:37:45,318 INFO L138 Inliner]: procedures = 110, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2024-11-10 22:37:45,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:37:45,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:37:45,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:37:45,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:37:45,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:45" (1/1) ... [2024-11-10 22:37:45,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:45" (1/1) ... [2024-11-10 22:37:45,344 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:45" (1/1) ... [2024-11-10 22:37:45,358 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [4, 5]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 5 writes are split as follows [2, 3]. [2024-11-10 22:37:45,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:45" (1/1) ... [2024-11-10 22:37:45,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:45" (1/1) ... [2024-11-10 22:37:45,366 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:45" (1/1) ... [2024-11-10 22:37:45,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:45" (1/1) ... [2024-11-10 22:37:45,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:45" (1/1) ... [2024-11-10 22:37:45,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:45" (1/1) ... [2024-11-10 22:37:45,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:37:45,371 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:37:45,371 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:37:45,371 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:37:45,372 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:45" (1/1) ... [2024-11-10 22:37:45,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:45,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:45,409 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 22:37:45,412 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 22:37:45,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 22:37:45,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 22:37:45,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 22:37:45,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 22:37:45,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 22:37:45,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 22:37:45,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:37:45,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:37:45,570 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:37:45,572 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:37:45,662 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-10 22:37:45,662 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:37:45,677 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:37:45,677 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:37:45,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:37:45 BoogieIcfgContainer [2024-11-10 22:37:45,678 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:37:45,679 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 22:37:45,679 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 22:37:45,684 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 22:37:45,685 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:37:45,685 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:37:44" (1/3) ... [2024-11-10 22:37:45,687 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30e03e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:37:45, skipping insertion in model container [2024-11-10 22:37:45,687 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:37:45,687 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:45" (2/3) ... [2024-11-10 22:37:45,689 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30e03e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:37:45, skipping insertion in model container [2024-11-10 22:37:45,689 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:37:45,689 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:37:45" (3/3) ... [2024-11-10 22:37:45,691 INFO L332 chiAutomizerObserver]: Analyzing ICFG Urban-2013WST-Fig2-alloca-2.i [2024-11-10 22:37:45,742 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 22:37:45,742 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 22:37:45,742 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 22:37:45,742 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 22:37:45,742 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 22:37:45,742 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 22:37:45,743 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 22:37:45,743 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 22:37:45,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 22:37:45,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-10 22:37:45,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:37:45,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:37:45,770 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:37:45,770 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:37:45,770 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 22:37:45,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 22:37:45,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-10 22:37:45,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:37:45,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:37:45,771 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:37:45,771 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:37:45,777 INFO L745 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 10#L552true [2024-11-10 22:37:45,778 INFO L747 eck$LassoCheckResult]: Loop: 10#L552true assume true;call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 9#L552-1true assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#1(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 11#L554true assume !true; 7#L557true call main_#t~mem9#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1; 10#L552true [2024-11-10 22:37:45,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:45,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1472, now seen corresponding path program 1 times [2024-11-10 22:37:45,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:45,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962243284] [2024-11-10 22:37:45,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:45,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:45,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:45,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:45,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:45,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1322586, now seen corresponding path program 1 times [2024-11-10 22:37:45,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:45,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849936789] [2024-11-10 22:37:45,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:45,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:37:46,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:37:46,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:37:46,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849936789] [2024-11-10 22:37:46,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849936789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:37:46,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:37:46,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 22:37:46,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079119667] [2024-11-10 22:37:46,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:37:46,038 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:37:46,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:37:46,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 22:37:46,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 22:37:46,069 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:37:46,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:37:46,077 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2024-11-10 22:37:46,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2024-11-10 22:37:46,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-10 22:37:46,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2024-11-10 22:37:46,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-10 22:37:46,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-10 22:37:46,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2024-11-10 22:37:46,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:37:46,091 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-11-10 22:37:46,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2024-11-10 22:37:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-11-10 22:37:46,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:37:46,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2024-11-10 22:37:46,119 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-11-10 22:37:46,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 22:37:46,126 INFO L425 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-11-10 22:37:46,127 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 22:37:46,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2024-11-10 22:37:46,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-10 22:37:46,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:37:46,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:37:46,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:37:46,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 22:37:46,129 INFO L745 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 31#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 32#L552 [2024-11-10 22:37:46,129 INFO L747 eck$LassoCheckResult]: Loop: 32#L552 assume true;call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 36#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#1(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 35#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 34#L554-1 assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1; 33#L557 call main_#t~mem9#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1; 32#L552 [2024-11-10 22:37:46,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:46,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1472, now seen corresponding path program 2 times [2024-11-10 22:37:46,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:46,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009811058] [2024-11-10 22:37:46,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:46,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:46,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:46,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:46,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:46,194 INFO L85 PathProgramCache]: Analyzing trace with hash 40999269, now seen corresponding path program 1 times [2024-11-10 22:37:46,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:46,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125703033] [2024-11-10 22:37:46,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:46,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:37:46,373 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 22:37:46,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:37:46,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125703033] [2024-11-10 22:37:46,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125703033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:37:46,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:37:46,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 22:37:46,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153358123] [2024-11-10 22:37:46,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:37:46,374 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:37:46,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:37:46,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 22:37:46,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 22:37:46,375 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:37:46,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:37:46,431 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2024-11-10 22:37:46,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2024-11-10 22:37:46,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:37:46,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2024-11-10 22:37:46,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-10 22:37:46,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-10 22:37:46,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2024-11-10 22:37:46,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:37:46,433 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-10 22:37:46,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2024-11-10 22:37:46,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-10 22:37:46,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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 22:37:46,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-11-10 22:37:46,435 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-10 22:37:46,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 22:37:46,436 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-10 22:37:46,436 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 22:37:46,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2024-11-10 22:37:46,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:37:46,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:37:46,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:37:46,437 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:37:46,438 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2024-11-10 22:37:46,438 INFO L745 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 56#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 57#L552 [2024-11-10 22:37:46,438 INFO L747 eck$LassoCheckResult]: Loop: 57#L552 assume true;call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 61#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#1(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 62#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 59#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 60#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 63#L554-1 assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1; 58#L557 call main_#t~mem9#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1; 57#L552 [2024-11-10 22:37:46,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:46,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1472, now seen corresponding path program 3 times [2024-11-10 22:37:46,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:46,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620579068] [2024-11-10 22:37:46,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:46,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:46,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:46,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:46,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:46,478 INFO L85 PathProgramCache]: Analyzing trace with hash 745656358, now seen corresponding path program 1 times [2024-11-10 22:37:46,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:46,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962646127] [2024-11-10 22:37:46,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:46,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:37:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:37:46,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:37:46,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962646127] [2024-11-10 22:37:46,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962646127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:37:46,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784619726] [2024-11-10 22:37:46,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:46,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:37:46,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:46,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:37:46,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 22:37:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:37:46,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 22:37:46,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:37:46,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 22:37:46,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 22:37:46,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 22:37:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:37:46,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:37:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:37:46,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784619726] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:37:46,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:37:46,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2024-11-10 22:37:46,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82036674] [2024-11-10 22:37:46,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:37:46,968 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:37:46,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:37:46,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 22:37:46,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-10 22:37:46,969 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 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 22:37:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:37:47,051 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2024-11-10 22:37:47,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2024-11-10 22:37:47,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-10 22:37:47,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2024-11-10 22:37:47,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-10 22:37:47,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-10 22:37:47,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2024-11-10 22:37:47,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:37:47,053 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-10 22:37:47,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2024-11-10 22:37:47,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-10 22:37:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 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 22:37:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-10 22:37:47,055 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-10 22:37:47,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 22:37:47,057 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-10 22:37:47,058 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 22:37:47,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2024-11-10 22:37:47,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-10 22:37:47,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:37:47,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:37:47,060 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:37:47,060 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1] [2024-11-10 22:37:47,061 INFO L745 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 135#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 136#L552 [2024-11-10 22:37:47,061 INFO L747 eck$LassoCheckResult]: Loop: 136#L552 assume true;call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 140#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#1(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 141#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 138#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 139#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 142#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 148#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 147#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 146#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 145#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 144#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 143#L554-1 assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1; 137#L557 call main_#t~mem9#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1; 136#L552 [2024-11-10 22:37:47,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:47,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1472, now seen corresponding path program 4 times [2024-11-10 22:37:47,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:47,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899756212] [2024-11-10 22:37:47,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:47,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:47,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:47,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:47,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:47,098 INFO L85 PathProgramCache]: Analyzing trace with hash 551987945, now seen corresponding path program 2 times [2024-11-10 22:37:47,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:47,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715852500] [2024-11-10 22:37:47,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:47,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:37:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:37:47,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:37:47,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715852500] [2024-11-10 22:37:47,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715852500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:37:47,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615618726] [2024-11-10 22:37:47,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 22:37:47,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:37:47,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:47,573 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:37:47,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 22:37:47,647 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 22:37:47,647 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:37:47,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 22:37:47,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:37:47,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 22:37:47,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 22:37:47,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 22:37:47,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 22:37:47,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 22:37:47,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 22:37:47,745 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:37:47,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:37:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:37:47,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615618726] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:37:47,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:37:47,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 18 [2024-11-10 22:37:47,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261752556] [2024-11-10 22:37:47,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:37:47,850 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:37:47,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:37:47,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 22:37:47,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2024-11-10 22:37:47,853 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 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 22:37:47,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:37:47,993 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-10 22:37:47,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2024-11-10 22:37:47,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-11-10 22:37:47,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2024-11-10 22:37:47,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-10 22:37:47,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-10 22:37:47,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2024-11-10 22:37:47,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:37:47,995 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-10 22:37:47,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2024-11-10 22:37:47,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-10 22:37:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 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 22:37:48,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-11-10 22:37:48,000 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-10 22:37:48,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 22:37:48,002 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-10 22:37:48,002 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 22:37:48,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2024-11-10 22:37:48,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-11-10 22:37:48,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:37:48,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:37:48,005 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:37:48,005 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1] [2024-11-10 22:37:48,005 INFO L745 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 278#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 279#L552 [2024-11-10 22:37:48,005 INFO L747 eck$LassoCheckResult]: Loop: 279#L552 assume true;call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 283#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#1(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 284#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 281#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 282#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 285#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 301#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 300#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 299#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 298#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 297#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 296#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 295#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 294#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 293#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 292#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 291#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 290#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 289#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 288#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 287#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 286#L554-1 assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1; 280#L557 call main_#t~mem9#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1; 279#L552 [2024-11-10 22:37:48,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:48,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1472, now seen corresponding path program 5 times [2024-11-10 22:37:48,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:48,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425470273] [2024-11-10 22:37:48,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:48,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:48,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:48,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:48,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:48,024 INFO L85 PathProgramCache]: Analyzing trace with hash -941060818, now seen corresponding path program 3 times [2024-11-10 22:37:48,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:48,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457453742] [2024-11-10 22:37:48,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:48,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:48,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:48,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:48,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:48,091 INFO L85 PathProgramCache]: Analyzing trace with hash -723746673, now seen corresponding path program 1 times [2024-11-10 22:37:48,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:48,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12743523] [2024-11-10 22:37:48,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:48,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:48,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:48,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:51,498 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:37:51,499 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:37:51,499 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:37:51,499 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:37:51,500 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:37:51,500 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:51,500 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:37:51,500 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:37:51,500 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca-2.i_Iteration5_Lasso [2024-11-10 22:37:51,500 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:37:51,500 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:37:51,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:51,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:51,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:51,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:51,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:51,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:51,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:51,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:51,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:51,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:51,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:52,062 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:37:52,065 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:37:52,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:52,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:52,068 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 22:37:52,069 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 22:37:52,070 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 22:37:52,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:52,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:37:52,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:52,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:52,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:52,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:37:52,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:37:52,089 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:52,104 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 22:37:52,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:52,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:52,107 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 22:37:52,109 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 22:37:52,110 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 22:37:52,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:52,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:37:52,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:52,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:52,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:52,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:37:52,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:37:52,123 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:52,138 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 22:37:52,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:52,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:52,163 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 22:37:52,164 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 22:37:52,165 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 22:37:52,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:52,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:52,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:52,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:52,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:37:52,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:37:52,186 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:52,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-10 22:37:52,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:52,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:52,207 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 22:37:52,209 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 22:37:52,210 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 22:37:52,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:52,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:37:52,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:52,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:52,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:52,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:37:52,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:37:52,229 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:52,244 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 22:37:52,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:52,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:52,284 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 22:37:52,287 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 22:37:52,288 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 22:37:52,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:52,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:52,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:52,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:52,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:37:52,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:37:52,309 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:52,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-10 22:37:52,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:52,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:52,351 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 22:37:52,352 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 22:37:52,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 22:37:52,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:52,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:37:52,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:52,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:52,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:52,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:37:52,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:37:52,368 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:52,381 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 22:37:52,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:52,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:52,383 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 22:37:52,383 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 22:37:52,384 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 22:37:52,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:52,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:37:52,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:52,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:52,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:52,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:37:52,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:37:52,397 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:52,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-10 22:37:52,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:52,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:52,410 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 22:37:52,411 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 22:37:52,411 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 22:37:52,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:52,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:37:52,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:52,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:52,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:52,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:37:52,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:37:52,429 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:37:52,434 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 22:37:52,434 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 22:37:52,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:52,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:52,438 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 22:37:52,439 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 22:37:52,440 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:37:52,440 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 22:37:52,440 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:37:52,441 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x1~0#1.base) ULTIMATE.start_main_~x1~0#1.offset)_1) = -2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x1~0#1.base) ULTIMATE.start_main_~x1~0#1.offset)_1 + 21 Supporting invariants [] [2024-11-10 22:37:52,455 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 22:37:52,493 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2024-11-10 22:37:52,502 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-10 22:37:52,502 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-10 22:37:52,503 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x1~0!base,]]] [2024-11-10 22:37:52,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:37:52,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:37:52,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:37:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:37:52,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 22:37:52,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:37:52,736 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-10 22:37:52,740 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-10 22:37:52,741 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:37:52,795 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 51 transitions. Complement of second has 6 states. [2024-11-10 22:37:52,796 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 22:37:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:37:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-10 22:37:52,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 23 letters. [2024-11-10 22:37:52,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:37:52,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 25 letters. Loop has 23 letters. [2024-11-10 22:37:52,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:37:52,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 46 letters. [2024-11-10 22:37:52,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:37:52,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 51 transitions. [2024-11-10 22:37:52,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:37:52,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 47 states and 50 transitions. [2024-11-10 22:37:52,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-10 22:37:52,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-10 22:37:52,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 50 transitions. [2024-11-10 22:37:52,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:37:52,805 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-11-10 22:37:52,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 50 transitions. [2024-11-10 22:37:52,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29. [2024-11-10 22:37:52,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 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 22:37:52,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-11-10 22:37:52,808 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-10 22:37:52,808 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-10 22:37:52,808 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 22:37:52,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 32 transitions. [2024-11-10 22:37:52,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:37:52,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:37:52,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:37:52,809 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-10 22:37:52,809 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:37:52,809 INFO L745 eck$LassoCheckResult]: Stem: 492#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 493#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 494#L552 assume true;call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 501#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#1(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 498#L554 [2024-11-10 22:37:52,809 INFO L747 eck$LassoCheckResult]: Loop: 498#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 497#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 498#L554 [2024-11-10 22:37:52,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:52,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1415007, now seen corresponding path program 1 times [2024-11-10 22:37:52,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:52,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059570420] [2024-11-10 22:37:52,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:52,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:52,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:52,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:52,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:52,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 1 times [2024-11-10 22:37:52,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:52,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504210779] [2024-11-10 22:37:52,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:52,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:52,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:52,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:52,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:52,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1359821950, now seen corresponding path program 1 times [2024-11-10 22:37:52,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:52,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215514909] [2024-11-10 22:37:52,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:52,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:52,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:52,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:53,168 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:37:53,168 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:37:53,168 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:37:53,168 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:37:53,168 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:37:53,168 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:53,168 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:37:53,168 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:37:53,168 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca-2.i_Iteration6_Lasso [2024-11-10 22:37:53,168 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:37:53,168 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:37:53,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:53,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:53,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:53,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:53,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:53,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:53,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:53,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:53,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:53,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:53,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:53,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:53,521 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:37:53,521 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:37:53,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:53,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:53,525 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 22:37:53,529 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 22:37:53,530 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 22:37:53,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:53,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:37:53,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:53,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:53,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:53,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:37:53,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:37:53,546 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:53,557 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 22:37:53,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:53,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:53,558 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 22:37:53,560 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 22:37:53,560 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 22:37:53,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:53,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:37:53,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:53,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:53,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:53,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:37:53,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:37:53,572 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:53,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-10 22:37:53,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:53,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:53,585 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 22:37:53,587 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 22:37:53,588 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 22:37:53,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:53,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:53,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:53,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:53,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:37:53,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:37:53,614 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:53,629 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 22:37:53,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:53,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:53,632 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:53,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-10 22:37:53,634 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 22:37:53,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:53,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:53,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:53,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:53,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:37:53,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:37:53,655 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:37:53,665 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-10 22:37:53,665 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-10 22:37:53,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:53,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:53,667 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:53,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-10 22:37:53,670 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:37:53,681 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:37:53,681 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:37:53,681 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_2) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_2 Supporting invariants [] [2024-11-10 22:37:53,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-10 22:37:53,709 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-10 22:37:53,711 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-10 22:37:53,711 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-10 22:37:53,711 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x2~0!base,]]] [2024-11-10 22:37:53,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:37:53,763 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 22:37:53,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:37:53,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:37:53,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-10 22:37:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:37:53,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:37:53,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:37:53,810 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 22:37:53,810 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 22:37:53,810 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:37:53,832 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 73 states and 79 transitions. Complement of second has 7 states. [2024-11-10 22:37:53,834 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 22:37:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:37:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-10 22:37:53,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-10 22:37:53,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:37:53,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-10 22:37:53,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:37:53,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-10 22:37:53,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:37:53,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 79 transitions. [2024-11-10 22:37:53,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:37:53,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 55 states and 59 transitions. [2024-11-10 22:37:53,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-10 22:37:53,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-10 22:37:53,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions. [2024-11-10 22:37:53,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:37:53,841 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-11-10 22:37:53,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions. [2024-11-10 22:37:53,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-11-10 22:37:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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 22:37:53,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-11-10 22:37:53,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-11-10 22:37:53,847 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-11-10 22:37:53,848 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 22:37:53,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 53 transitions. [2024-11-10 22:37:53,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:37:53,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:37:53,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:37:53,851 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 2, 2, 1, 1, 1, 1] [2024-11-10 22:37:53,851 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:37:53,851 INFO L745 eck$LassoCheckResult]: Stem: 659#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 660#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 661#L552 assume true;call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 671#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#1(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 708#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 707#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 706#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 704#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 702#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 700#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 698#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 696#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 694#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 692#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 690#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 688#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 686#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 684#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 682#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 680#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 678#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 677#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 676#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 672#L554-1 assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1; 662#L557 call main_#t~mem9#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1; 663#L552 assume true;call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 668#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#1(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 665#L554 [2024-11-10 22:37:53,851 INFO L747 eck$LassoCheckResult]: Loop: 665#L554 assume true;call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 664#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 665#L554 [2024-11-10 22:37:53,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:53,852 INFO L85 PathProgramCache]: Analyzing trace with hash 264149614, now seen corresponding path program 2 times [2024-11-10 22:37:53,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:53,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462605582] [2024-11-10 22:37:53,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:53,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:53,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:53,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:53,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:53,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 2 times [2024-11-10 22:37:53,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:53,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914977685] [2024-11-10 22:37:53,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:53,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:53,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:53,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:53,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:53,911 INFO L85 PathProgramCache]: Analyzing trace with hash 444708813, now seen corresponding path program 3 times [2024-11-10 22:37:53,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:53,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133160015] [2024-11-10 22:37:53,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:53,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:53,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:53,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:59,430 WARN L286 SmtUtils]: Spent 5.44s on a formula simplification. DAG size of input: 189 DAG size of output: 165 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-10 22:37:59,555 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:37:59,555 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:37:59,555 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:37:59,555 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:37:59,555 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:37:59,555 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:59,555 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:37:59,555 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:37:59,556 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca-2.i_Iteration7_Lasso [2024-11-10 22:37:59,556 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:37:59,556 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:37:59,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:59,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:59,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:59,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:59,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:59,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:59,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:59,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:59,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:59,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:59,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:59,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:59,843 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:37:59,843 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:37:59,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:59,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:59,845 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:59,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-10 22:37:59,848 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 22:37:59,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:59,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:37:59,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:59,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:59,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:59,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:37:59,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:37:59,859 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:59,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-10 22:37:59,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:59,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:59,871 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:59,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-10 22:37:59,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 22:37:59,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:59,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:59,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:59,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:59,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:37:59,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:37:59,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:59,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-10 22:37:59,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:59,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:59,915 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:59,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-10 22:37:59,917 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 22:37:59,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:59,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:59,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:59,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:59,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:37:59,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:37:59,935 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:59,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-10 22:37:59,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:59,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:59,951 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:59,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-10 22:37:59,952 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 22:37:59,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:59,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:59,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:59,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:59,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:37:59,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:37:59,970 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:37:59,978 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-10 22:37:59,978 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-11-10 22:37:59,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:59,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:59,980 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:59,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-10 22:37:59,982 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:37:59,993 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:37:59,993 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:37:59,993 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_3) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_3 Supporting invariants [] [2024-11-10 22:38:00,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-10 22:38:00,017 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-10 22:38:00,018 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-10 22:38:00,018 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-10 22:38:00,018 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x2~0!base,]]] [2024-11-10 22:38:00,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:38:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:38:00,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:38:00,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:38:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:38:00,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:38:00,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:38:00,137 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 22:38:00,138 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 22:38:00,138 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 22:38:00,157 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 68 states and 73 transitions. Complement of second has 7 states. [2024-11-10 22:38:00,158 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 22:38:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 22:38:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-10 22:38:00,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2024-11-10 22:38:00,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:38:00,159 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:38:00,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:38:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:38:00,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:38:00,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:38:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:38:00,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:38:00,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:38:00,276 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 22:38:00,277 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 22:38:00,277 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 22:38:00,300 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 68 states and 73 transitions. Complement of second has 7 states. [2024-11-10 22:38:00,301 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 22:38:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 22:38:00,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-10 22:38:00,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2024-11-10 22:38:00,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:38:00,302 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:38:00,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:38:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:38:00,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:38:00,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:38:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:38:00,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:38:00,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:38:00,410 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 22:38:00,411 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 22:38:00,411 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 22:38:00,436 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 76 states and 82 transitions. Complement of second has 6 states. [2024-11-10 22:38:00,438 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 22:38:00,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 22:38:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-11-10 22:38:00,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 27 letters. Loop has 2 letters. [2024-11-10 22:38:00,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:38:00,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 29 letters. Loop has 2 letters. [2024-11-10 22:38:00,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:38:00,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 27 letters. Loop has 4 letters. [2024-11-10 22:38:00,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:38:00,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 82 transitions. [2024-11-10 22:38:00,444 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 22:38:00,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 0 states and 0 transitions. [2024-11-10 22:38:00,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-10 22:38:00,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-10 22:38:00,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-10 22:38:00,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:38:00,447 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 22:38:00,447 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 22:38:00,448 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 22:38:00,448 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-10 22:38:00,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-10 22:38:00,448 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 22:38:00,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-10 22:38:00,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:38:00 BoogieIcfgContainer [2024-11-10 22:38:00,456 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 22:38:00,456 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 22:38:00,457 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 22:38:00,457 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 22:38:00,457 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:37:45" (3/4) ... [2024-11-10 22:38:00,459 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 22:38:00,461 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 22:38:00,461 INFO L158 Benchmark]: Toolchain (without parser) took 15669.06ms. Allocated memory was 192.9MB in the beginning and 237.0MB in the end (delta: 44.0MB). Free memory was 138.3MB in the beginning and 151.0MB in the end (delta: -12.7MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2024-11-10 22:38:00,461 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 125.8MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:38:00,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.95ms. Allocated memory is still 192.9MB. Free memory was 137.8MB in the beginning and 119.3MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 22:38:00,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.25ms. Allocated memory is still 192.9MB. Free memory was 119.3MB in the beginning and 117.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:38:00,462 INFO L158 Benchmark]: Boogie Preprocessor took 50.24ms. Allocated memory is still 192.9MB. Free memory was 117.3MB in the beginning and 115.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:38:00,462 INFO L158 Benchmark]: IcfgBuilder took 307.31ms. Allocated memory is still 192.9MB. Free memory was 115.7MB in the beginning and 156.6MB in the end (delta: -40.8MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2024-11-10 22:38:00,462 INFO L158 Benchmark]: BuchiAutomizer took 14776.98ms. Allocated memory was 192.9MB in the beginning and 237.0MB in the end (delta: 44.0MB). Free memory was 156.6MB in the beginning and 152.0MB in the end (delta: 4.5MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2024-11-10 22:38:00,463 INFO L158 Benchmark]: Witness Printer took 4.22ms. Allocated memory is still 237.0MB. Free memory was 152.0MB in the beginning and 151.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:38:00,464 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.21ms. Allocated memory is still 125.8MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.95ms. Allocated memory is still 192.9MB. Free memory was 137.8MB in the beginning and 119.3MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.25ms. Allocated memory is still 192.9MB. Free memory was 119.3MB in the beginning and 117.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.24ms. Allocated memory is still 192.9MB. Free memory was 117.3MB in the beginning and 115.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 307.31ms. Allocated memory is still 192.9MB. Free memory was 115.7MB in the beginning and 156.6MB in the end (delta: -40.8MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 14776.98ms. Allocated memory was 192.9MB in the beginning and 237.0MB in the end (delta: 44.0MB). Free memory was 156.6MB in the beginning and 152.0MB in the end (delta: 4.5MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * Witness Printer took 4.22ms. Allocated memory is still 237.0MB. Free memory was 152.0MB in the beginning and 151.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x1~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x2~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x2~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function null and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.7s and 8 iterations. TraceHistogramMax:10. Analysis of lassos took 13.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 90/90 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 142 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 115 IncrementalHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 63 mSDtfsCounter, 115 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital149 mio100 ax112 hnf100 lsp87 ukn62 mio100 lsp26 div100 bol100 ite100 ukn100 eq163 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 46ms 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 22:38:00,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-10 22:38:00,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 22:38:00,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 22:38:01,093 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