./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 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/Urban-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.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:18:52,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:18:52,835 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:18:52,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:18:52,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:18:52,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:18:52,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:18:52,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:18:52,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:18:52,869 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:18:52,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:18:52,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:18:52,871 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:18:52,872 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:18:52,874 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:18:52,874 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:18:52,874 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:18:52,875 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:18:52,875 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:18:52,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:18:52,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:18:52,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:18:52,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:18:52,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:18:52,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:18:52,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:18:52,877 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:18:52,878 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:18:52,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:18:52,878 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:18:52,878 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:18:52,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:18:52,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:18:52,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:18:52,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:18:52,884 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:18:52,884 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-19 14:18:53,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:18:53,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:18:53,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:18:53,198 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:18:53,199 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:18:53,200 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-19 14:18:54,645 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:18:54,899 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:18:54,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca-2.i [2024-11-19 14:18:54,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efc51ff79/4e37bf2ca4dd41b082a326d4e86ab772/FLAGc7817cfdf [2024-11-19 14:18:54,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efc51ff79/4e37bf2ca4dd41b082a326d4e86ab772 [2024-11-19 14:18:54,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:18:54,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:18:54,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:18:54,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:18:54,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:18:54,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:18:54" (1/1) ... [2024-11-19 14:18:54,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711a11d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:54, skipping insertion in model container [2024-11-19 14:18:54,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:18:54" (1/1) ... [2024-11-19 14:18:54,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:18:55,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:18:55,391 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:18:55,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:18:55,474 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:18:55,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55 WrapperNode [2024-11-19 14:18:55,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:18:55,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:18:55,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:18:55,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:18:55,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,511 INFO L138 Inliner]: procedures = 110, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2024-11-19 14:18:55,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:18:55,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:18:55,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:18:55,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:18:55,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,542 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-19 14:18:55,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:18:55,566 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:18:55,566 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:18:55,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:18:55,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (1/1) ... [2024-11-19 14:18:55,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:18:55,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:18:55,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:18:55,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:18:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 14:18:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 14:18:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 14:18:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 14:18:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 14:18:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:18:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:18:55,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:18:55,769 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:18:55,771 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:18:55,886 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-19 14:18:55,890 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:18:55,902 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:18:55,903 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 14:18:55,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:18:55 BoogieIcfgContainer [2024-11-19 14:18:55,904 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:18:55,905 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:18:55,905 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:18:55,911 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:18:55,913 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:18:55,913 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:18:54" (1/3) ... [2024-11-19 14:18:55,915 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@720b67b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:18:55, skipping insertion in model container [2024-11-19 14:18:55,915 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:18:55,915 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:55" (2/3) ... [2024-11-19 14:18:55,915 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@720b67b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:18:55, skipping insertion in model container [2024-11-19 14:18:55,915 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:18:55,915 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:18:55" (3/3) ... [2024-11-19 14:18:55,917 INFO L332 chiAutomizerObserver]: Analyzing ICFG Urban-2013WST-Fig2-alloca-2.i [2024-11-19 14:18:55,978 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:18:55,979 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:18:55,979 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:18:55,979 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:18:55,979 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:18:55,980 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:18:55,980 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:18:55,980 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:18:55,985 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-19 14:18:56,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:18:56,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:18:56,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:18:56,010 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:18:56,010 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:18:56,010 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:18:56,011 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-19 14:18:56,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:18:56,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:18:56,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:18:56,013 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:18:56,013 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:18:56,020 INFO L745 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~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; 3#L552-3true [2024-11-19 14:18:56,021 INFO L747 eck$LassoCheckResult]: Loop: 3#L552-3true call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 11#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); 7#L554-3true assume !true; 10#L554-4true 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; 3#L552-3true [2024-11-19 14:18:56,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:56,027 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:18:56,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:56,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316016384] [2024-11-19 14:18:56,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:18:56,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:56,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:18:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:56,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:18:56,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2024-11-19 14:18:56,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:56,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500470577] [2024-11-19 14:18:56,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:18:56,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:18:56,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:18:56,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:18:56,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500470577] [2024-11-19 14:18:56,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500470577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:18:56,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:18:56,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:18:56,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636882983] [2024-11-19 14:18:56,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:18:56,330 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:18:56,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:18:56,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 14:18:56,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 14:18:56,368 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-19 14:18:56,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:18:56,375 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2024-11-19 14:18:56,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2024-11-19 14:18:56,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:18:56,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2024-11-19 14:18:56,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-19 14:18:56,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-19 14:18:56,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2024-11-19 14:18:56,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:18:56,382 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-11-19 14:18:56,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2024-11-19 14:18:56,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-11-19 14:18:56,408 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-19 14:18:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2024-11-19 14:18:56,410 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-11-19 14:18:56,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 14:18:56,416 INFO L425 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-11-19 14:18:56,416 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:18:56,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2024-11-19 14:18:56,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:18:56,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:18:56,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:18:56,417 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:18:56,417 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-19 14:18:56,417 INFO L745 eck$LassoCheckResult]: Stem: 32#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 33#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~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; 30#L552-3 [2024-11-19 14:18:56,417 INFO L747 eck$LassoCheckResult]: Loop: 30#L552-3 call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 31#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); 34#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 35#L554-1 assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1; 36#L554-4 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; 30#L552-3 [2024-11-19 14:18:56,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:56,418 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-19 14:18:56,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:56,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828175186] [2024-11-19 14:18:56,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:18:56,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:56,451 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:18:56,453 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:18:56,454 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:18:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:56,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:18:56,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:56,482 INFO L85 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2024-11-19 14:18:56,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:56,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661156176] [2024-11-19 14:18:56,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:18:56,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:18:56,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:18:56,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:18:56,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661156176] [2024-11-19 14:18:56,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661156176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:18:56,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:18:56,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:18:56,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714084087] [2024-11-19 14:18:56,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:18:56,643 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:18:56,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:18:56,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:18:56,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:18:56,644 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-19 14:18:56,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:18:56,687 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2024-11-19 14:18:56,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2024-11-19 14:18:56,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-19 14:18:56,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2024-11-19 14:18:56,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-19 14:18:56,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-19 14:18:56,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2024-11-19 14:18:56,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:18:56,689 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-19 14:18:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2024-11-19 14:18:56,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-19 14:18:56,690 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-19 14:18:56,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-11-19 14:18:56,691 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-19 14:18:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:18:56,693 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-19 14:18:56,694 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:18:56,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2024-11-19 14:18:56,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-19 14:18:56,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:18:56,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:18:56,696 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:18:56,696 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2024-11-19 14:18:56,696 INFO L745 eck$LassoCheckResult]: Stem: 59#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 60#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~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; 55#L552-3 [2024-11-19 14:18:56,697 INFO L747 eck$LassoCheckResult]: Loop: 55#L552-3 call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 56#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); 57#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 58#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; 61#L554-3 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; 62#L554-4 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; 55#L552-3 [2024-11-19 14:18:56,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:56,699 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-19 14:18:56,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:56,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127751039] [2024-11-19 14:18:56,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:18:56,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:56,717 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:18:56,717 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:18:56,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:18:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:56,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:18:56,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:56,729 INFO L85 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2024-11-19 14:18:56,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:56,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994506120] [2024-11-19 14:18:56,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:18:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:18:56,971 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-19 14:18:56,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:18:56,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994506120] [2024-11-19 14:18:56,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994506120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:18:56,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949334341] [2024-11-19 14:18:56,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:18:56,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:18:56,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:18:56,975 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-19 14:18:56,977 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-19 14:18:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:18:57,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 14:18:57,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:18:57,113 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-19 14:18:57,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 14:18:57,150 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-19 14:18:57,155 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-19 14:18:57,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:18:57,199 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-19 14:18:57,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949334341] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:18:57,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:18:57,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2024-11-19 14:18:57,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968860640] [2024-11-19 14:18:57,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:18:57,200 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:18:57,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:18:57,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 14:18:57,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-19 14:18:57,201 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-19 14:18:57,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:18:57,260 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2024-11-19 14:18:57,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2024-11-19 14:18:57,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-19 14:18:57,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2024-11-19 14:18:57,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-19 14:18:57,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-19 14:18:57,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2024-11-19 14:18:57,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:18:57,264 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-19 14:18:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2024-11-19 14:18:57,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-19 14:18:57,266 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-19 14:18:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-19 14:18:57,267 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-19 14:18:57,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 14:18:57,268 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-19 14:18:57,269 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:18:57,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2024-11-19 14:18:57,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-19 14:18:57,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:18:57,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:18:57,271 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:18:57,272 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1] [2024-11-19 14:18:57,272 INFO L745 eck$LassoCheckResult]: Stem: 138#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 139#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~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; 134#L552-3 [2024-11-19 14:18:57,272 INFO L747 eck$LassoCheckResult]: Loop: 134#L552-3 call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 135#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); 142#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 140#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; 136#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 137#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-3 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-3 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-3 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; 141#L554-4 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; 134#L552-3 [2024-11-19 14:18:57,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:57,273 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-19 14:18:57,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:57,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679889379] [2024-11-19 14:18:57,274 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:18:57,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:57,296 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:18:57,296 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:18:57,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:18:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:57,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:18:57,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:57,310 INFO L85 PathProgramCache]: Analyzing trace with hash 351922269, now seen corresponding path program 2 times [2024-11-19 14:18:57,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:57,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105580344] [2024-11-19 14:18:57,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:18:57,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:57,331 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:18:57,332 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:18:57,723 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-19 14:18:57,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:18:57,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105580344] [2024-11-19 14:18:57,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105580344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:18:57,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892585771] [2024-11-19 14:18:57,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:18:57,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:18:57,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:18:57,750 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-19 14:18:57,752 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-19 14:18:57,824 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:18:57,825 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:18:57,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 14:18:57,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:18:57,843 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-19 14:18:57,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 14:18:57,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 14:18:57,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 14:18:57,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 14:18:57,905 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-19 14:18:57,909 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-19 14:18:57,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:18:58,021 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-19 14:18:58,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892585771] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:18:58,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:18:58,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 16 [2024-11-19 14:18:58,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062367999] [2024-11-19 14:18:58,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:18:58,024 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:18:58,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:18:58,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 14:18:58,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-11-19 14:18:58,028 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:18:58,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:18:58,161 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-19 14:18:58,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2024-11-19 14:18:58,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-11-19 14:18:58,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2024-11-19 14:18:58,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-19 14:18:58,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-19 14:18:58,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2024-11-19 14:18:58,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:18:58,167 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-19 14:18:58,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2024-11-19 14:18:58,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-19 14:18:58,169 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-19 14:18:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-11-19 14:18:58,169 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-19 14:18:58,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 14:18:58,172 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-19 14:18:58,173 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:18:58,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2024-11-19 14:18:58,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-11-19 14:18:58,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:18:58,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:18:58,175 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:18:58,175 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1] [2024-11-19 14:18:58,176 INFO L745 eck$LassoCheckResult]: Stem: 281#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 282#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~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; 277#L552-3 [2024-11-19 14:18:58,176 INFO L747 eck$LassoCheckResult]: Loop: 277#L552-3 call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 278#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); 285#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 283#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; 279#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 280#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-3 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-3 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-3 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-3 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-3 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-3 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-3 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-3 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; 284#L554-4 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; 277#L552-3 [2024-11-19 14:18:58,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:58,176 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-19 14:18:58,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:58,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392017466] [2024-11-19 14:18:58,177 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:18:58,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:58,189 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:18:58,190 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:18:58,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:18:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:58,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:18:58,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:58,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1943458812, now seen corresponding path program 3 times [2024-11-19 14:18:58,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:58,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722939765] [2024-11-19 14:18:58,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:18:58,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:58,226 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-19 14:18:58,226 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:18:58,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:18:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:58,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:18:58,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:18:58,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1979445758, now seen corresponding path program 1 times [2024-11-19 14:18:58,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:18:58,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246644075] [2024-11-19 14:18:58,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:18:58,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:18:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:58,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:18:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:18:58,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:01,599 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:19:01,600 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:19:01,600 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:19:01,600 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:19:01,600 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:19:01,601 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:01,601 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:19:01,601 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:19:01,601 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca-2.i_Iteration5_Lasso [2024-11-19 14:19:01,601 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:19:01,602 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:19:01,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:01,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:02,150 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:19:02,155 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:19:02,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:02,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:02,160 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:02,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-19 14:19:02,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:02,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:02,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:02,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:02,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:02,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:02,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:02,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:02,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:02,202 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-19 14:19:02,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:02,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:02,204 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:02,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 14:19:02,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:02,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:02,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:02,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:02,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:02,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:02,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:02,226 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:02,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:02,246 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-19 14:19:02,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:02,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:02,249 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:02,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 14:19:02,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:02,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:02,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:02,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:02,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:02,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:02,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:02,273 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:02,288 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-19 14:19:02,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:02,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:02,291 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:02,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-19 14:19:02,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:02,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:02,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:02,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:02,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:02,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:02,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:02,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:02,309 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:02,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-19 14:19:02,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:02,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:02,321 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:02,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-19 14:19:02,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:02,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:02,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:02,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:02,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:02,336 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:02,336 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:02,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:02,355 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-19 14:19:02,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:02,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:02,357 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:02,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-19 14:19:02,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:02,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:02,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:02,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:02,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:02,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:02,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:02,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:02,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:02,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-19 14:19:02,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:02,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:02,382 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:02,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-19 14:19:02,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-19 14:19:02,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:02,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:02,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:02,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:02,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:02,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:02,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:02,397 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:02,407 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-19 14:19:02,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:02,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:02,409 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:02,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-19 14:19:02,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-19 14:19:02,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:02,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:02,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:02,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:02,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:02,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:02,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:02,424 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:19:02,428 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:19:02,428 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:19:02,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:02,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:02,431 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:02,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-19 14:19:02,433 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:19:02,433 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:19:02,433 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:19:02,433 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-19 14:19:02,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-19 14:19:02,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-19 14:19:02,512 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2024-11-19 14:19:02,520 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:19:02,520 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:19:02,520 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x1~0!base,]]] [2024-11-19 14:19:02,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:02,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:19:02,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:02,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:19:02,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:02,751 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-19 14:19:02,755 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-19 14:19:02,756 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-19 14:19:02,799 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-19 14:19:02,800 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-19 14:19:02,801 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-19 14:19:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-19 14:19:02,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 23 letters. [2024-11-19 14:19:02,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:02,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 25 letters. Loop has 23 letters. [2024-11-19 14:19:02,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:02,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 46 letters. [2024-11-19 14:19:02,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:02,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 51 transitions. [2024-11-19 14:19:02,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:02,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 47 states and 50 transitions. [2024-11-19 14:19:02,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-19 14:19:02,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-19 14:19:02,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 50 transitions. [2024-11-19 14:19:02,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:02,808 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-11-19 14:19:02,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 50 transitions. [2024-11-19 14:19:02,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29. [2024-11-19 14:19:02,811 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-19 14:19:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-11-19 14:19:02,811 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-19 14:19:02,811 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-19 14:19:02,812 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:19:02,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 32 transitions. [2024-11-19 14:19:02,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:02,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:02,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:02,813 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-19 14:19:02,813 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:19:02,813 INFO L745 eck$LassoCheckResult]: Stem: 500#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 501#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~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; 492#L552-3 call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 494#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); 496#L554-3 [2024-11-19 14:19:02,813 INFO L747 eck$LassoCheckResult]: Loop: 496#L554-3 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; 496#L554-3 [2024-11-19 14:19:02,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:02,814 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2024-11-19 14:19:02,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:02,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906640733] [2024-11-19 14:19:02,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:02,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:02,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:02,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:02,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:02,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2024-11-19 14:19:02,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:02,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338781083] [2024-11-19 14:19:02,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:02,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:02,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:02,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:02,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:02,853 INFO L85 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2024-11-19 14:19:02,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:02,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005954607] [2024-11-19 14:19:02,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:02,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:02,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:02,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:03,161 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:19:03,162 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:19:03,162 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:19:03,162 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:19:03,162 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:19:03,162 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:03,162 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:19:03,162 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:19:03,162 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca-2.i_Iteration6_Lasso [2024-11-19 14:19:03,162 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:19:03,163 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:19:03,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:03,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:03,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:03,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:03,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:03,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:03,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:03,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:03,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:03,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:03,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:03,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:03,523 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:19:03,523 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:19:03,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:03,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:03,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-19 14:19:03,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-19 14:19:03,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:03,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:03,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:03,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:03,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:03,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:03,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:03,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:03,544 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:03,559 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-19 14:19:03,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:03,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:03,561 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:03,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-19 14:19:03,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:03,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:03,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:03,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:03,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:03,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:03,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:03,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:03,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:03,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:03,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:03,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:03,593 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:03,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-19 14:19:03,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:03,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:03,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:03,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:03,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:03,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:03,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:03,614 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:03,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:03,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:03,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:03,631 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:03,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-19 14:19:03,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:03,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:03,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:03,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:03,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:03,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:03,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:03,657 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:19:03,671 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-19 14:19:03,671 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-19 14:19:03,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:03,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:03,673 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:03,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-19 14:19:03,674 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:19:03,685 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:19:03,685 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:19:03,685 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-19 14:19:03,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:03,707 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-19 14:19:03,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-19 14:19:03,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-19 14:19:03,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x2~0!base,]]] [2024-11-19 14:19:03,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:03,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:19:03,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:03,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:19:03,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:03,774 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-19 14:19:03,774 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-19 14:19:03,801 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-19 14:19:03,803 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-19 14:19:03,803 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-19 14:19:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-19 14:19:03,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-19 14:19:03,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:03,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-19 14:19:03,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:03,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-19 14:19:03,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:03,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 79 transitions. [2024-11-19 14:19:03,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:03,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 55 states and 59 transitions. [2024-11-19 14:19:03,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-19 14:19:03,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-19 14:19:03,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions. [2024-11-19 14:19:03,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:03,811 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-11-19 14:19:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions. [2024-11-19 14:19:03,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-11-19 14:19:03,813 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-19 14:19:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-11-19 14:19:03,817 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-11-19 14:19:03,818 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-11-19 14:19:03,818 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:19:03,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 53 transitions. [2024-11-19 14:19:03,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:03,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:03,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:03,820 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 2, 2, 1, 1, 1, 1] [2024-11-19 14:19:03,820 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:19:03,820 INFO L745 eck$LassoCheckResult]: Stem: 668#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 669#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~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; 659#L552-3 call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 660#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-3 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-3 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-3 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-3 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-3 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-3 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-3 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-3 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-3 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-3 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; 671#L554-4 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; 661#L552-3 call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 663#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); 664#L554-3 [2024-11-19 14:19:03,820 INFO L747 eck$LassoCheckResult]: Loop: 664#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 665#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; 664#L554-3 [2024-11-19 14:19:03,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:03,821 INFO L85 PathProgramCache]: Analyzing trace with hash 423138919, now seen corresponding path program 2 times [2024-11-19 14:19:03,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:03,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912583268] [2024-11-19 14:19:03,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:19:03,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:03,886 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-19 14:19:03,892 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:19:03,892 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:03,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:03,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:03,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:03,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 2 times [2024-11-19 14:19:03,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:03,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667367697] [2024-11-19 14:19:03,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:19:03,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:03,912 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:19:03,912 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:03,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:03,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:03,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:03,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1385391412, now seen corresponding path program 3 times [2024-11-19 14:19:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:03,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453221280] [2024-11-19 14:19:03,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:19:03,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:03,962 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-19 14:19:03,962 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:03,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:03,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:09,374 WARN L286 SmtUtils]: Spent 5.35s 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-19 14:19:09,510 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:19:09,510 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:19:09,510 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:19:09,510 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:19:09,510 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:19:09,510 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:09,510 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:19:09,510 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:19:09,510 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca-2.i_Iteration7_Lasso [2024-11-19 14:19:09,510 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:19:09,510 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:19:09,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:09,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:09,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:09,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:09,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:09,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:09,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:09,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:09,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:09,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:09,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:09,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:09,834 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:19:09,834 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:19:09,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:09,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:09,836 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:09,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-19 14:19:09,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:09,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:09,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:09,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:09,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:09,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:09,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:09,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:09,857 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:09,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-19 14:19:09,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:09,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:09,875 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:09,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-19 14:19:09,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:09,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:09,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:09,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:09,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:09,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:09,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:09,898 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:09,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:09,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:09,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:09,911 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:09,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-19 14:19:09,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:09,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:09,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:09,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:09,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:09,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:09,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:09,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:09,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-19 14:19:09,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:09,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:09,962 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:09,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-19 14:19:09,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:09,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:09,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:09,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:09,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:09,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:09,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:09,981 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:19:09,989 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-19 14:19:09,989 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-11-19 14:19:09,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:09,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:09,991 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:09,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-19 14:19:09,992 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:19:10,004 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:19:10,004 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:19:10,004 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-19 14:19:10,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:10,026 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-19 14:19:10,027 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-19 14:19:10,027 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-19 14:19:10,027 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x2~0!base,]]] [2024-11-19 14:19:10,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:10,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:19:10,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:10,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:19:10,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:10,146 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-19 14:19:10,146 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-19 14:19:10,170 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-19 14:19:10,171 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-19 14:19:10,171 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-19 14:19:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-19 14:19:10,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2024-11-19 14:19:10,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:10,172 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:19:10,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:10,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:19:10,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:10,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:19:10,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:10,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-19 14:19:10,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-19 14:19:10,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-19 14:19:10,297 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-19 14:19:10,300 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-19 14:19:10,300 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-19 14:19:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-19 14:19:10,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2024-11-19 14:19:10,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:10,301 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:19:10,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:10,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:19:10,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:10,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:19:10,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:10,403 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-19 14:19:10,404 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-19 14:19:10,427 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-19 14:19:10,428 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-19 14:19:10,429 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-19 14:19:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-11-19 14:19:10,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 27 letters. Loop has 2 letters. [2024-11-19 14:19:10,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:10,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 29 letters. Loop has 2 letters. [2024-11-19 14:19:10,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:10,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 27 letters. Loop has 4 letters. [2024-11-19 14:19:10,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:10,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 82 transitions. [2024-11-19 14:19:10,433 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:19:10,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 0 states and 0 transitions. [2024-11-19 14:19:10,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 14:19:10,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 14:19:10,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 14:19:10,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:19:10,434 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:19:10,434 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:19:10,434 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:19:10,434 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:19:10,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-19 14:19:10,434 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:19:10,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-19 14:19:10,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:19:10 BoogieIcfgContainer [2024-11-19 14:19:10,441 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:19:10,441 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:19:10,442 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:19:10,442 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:19:10,442 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:18:55" (3/4) ... [2024-11-19 14:19:10,444 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 14:19:10,445 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:19:10,445 INFO L158 Benchmark]: Toolchain (without parser) took 15509.90ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 100.1MB in the beginning and 116.7MB in the end (delta: -16.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-19 14:19:10,446 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:19:10,446 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.32ms. Allocated memory is still 159.4MB. Free memory was 99.6MB in the beginning and 126.7MB in the end (delta: -27.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 14:19:10,446 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.41ms. Allocated memory is still 159.4MB. Free memory was 126.7MB in the beginning and 124.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:19:10,446 INFO L158 Benchmark]: Boogie Preprocessor took 52.86ms. Allocated memory is still 159.4MB. Free memory was 124.6MB in the beginning and 123.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:19:10,446 INFO L158 Benchmark]: RCFGBuilder took 338.70ms. Allocated memory is still 159.4MB. Free memory was 123.1MB in the beginning and 111.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 14:19:10,447 INFO L158 Benchmark]: BuchiAutomizer took 14535.83ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 111.3MB in the beginning and 116.7MB in the end (delta: -5.5MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2024-11-19 14:19:10,447 INFO L158 Benchmark]: Witness Printer took 3.41ms. Allocated memory is still 209.7MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:19:10,451 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.69ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.32ms. Allocated memory is still 159.4MB. Free memory was 99.6MB in the beginning and 126.7MB in the end (delta: -27.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.41ms. Allocated memory is still 159.4MB. Free memory was 126.7MB in the beginning and 124.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.86ms. Allocated memory is still 159.4MB. Free memory was 124.6MB in the beginning and 123.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 338.70ms. Allocated memory is still 159.4MB. Free memory was 123.1MB in the beginning and 111.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 14535.83ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 111.3MB in the beginning and 116.7MB in the end (delta: -5.5MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. * Witness Printer took 3.41ms. Allocated memory is still 209.7MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#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 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.4s and 8 iterations. TraceHistogramMax:10. Analysis of lassos took 13.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. 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, 127 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 103 IncrementalHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 63 mSDtfsCounter, 103 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: 26ms 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-19 14:19:10,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:10,673 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-19 14:19:10,874 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-19 14:19:11,076 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