./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 Calling Ultimate with: /usr/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.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.graphml --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 7e4d89645739beae47f9c52ff5003bd634bd856a7fdd28a03c9ca1afb29cead1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 14:59:35,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 14:59:35,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 14:59:35,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 14:59:35,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 14:59:35,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 14:59:35,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 14:59:35,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 14:59:36,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 14:59:36,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 14:59:36,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 14:59:36,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 14:59:36,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 14:59:36,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 14:59:36,005 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 14:59:36,007 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 14:59:36,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 14:59:36,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 14:59:36,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 14:59:36,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 14:59:36,017 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 14:59:36,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 14:59:36,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 14:59:36,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 14:59:36,022 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 14:59:36,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 14:59:36,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 14:59:36,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 14:59:36,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 14:59:36,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 14:59:36,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 14:59:36,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 14:59:36,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 14:59:36,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 14:59:36,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 14:59:36,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 14:59:36,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 14:59:36,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 14:59:36,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 14:59:36,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 14:59:36,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 14:59:36,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 14:59:36,034 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 14:59:36,056 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 14:59:36,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 14:59:36,056 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 14:59:36,057 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 14:59:36,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 14:59:36,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 14:59:36,058 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 14:59:36,058 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 14:59:36,059 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 14:59:36,059 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 14:59:36,060 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 14:59:36,060 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 14:59:36,060 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 14:59:36,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 14:59:36,060 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 14:59:36,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 14:59:36,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 14:59:36,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 14:59:36,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 14:59:36,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 14:59:36,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 14:59:36,062 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 14:59:36,062 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 14:59:36,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 14:59:36,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 14:59:36,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 14:59:36,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 14:59:36,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 14:59:36,063 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 14:59:36,064 INFO L138 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.graphml 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 -> 7e4d89645739beae47f9c52ff5003bd634bd856a7fdd28a03c9ca1afb29cead1 [2022-07-14 14:59:36,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 14:59:36,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 14:59:36,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 14:59:36,266 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 14:59:36,267 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 14:59:36,267 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i [2022-07-14 14:59:36,324 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2c641ec1/1d1543cc65664fdabda39d4db0333bff/FLAGfabfa224f [2022-07-14 14:59:36,695 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 14:59:36,695 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i [2022-07-14 14:59:36,703 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2c641ec1/1d1543cc65664fdabda39d4db0333bff/FLAGfabfa224f [2022-07-14 14:59:36,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2c641ec1/1d1543cc65664fdabda39d4db0333bff [2022-07-14 14:59:36,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 14:59:36,715 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 14:59:36,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 14:59:36,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 14:59:36,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 14:59:36,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:59:36" (1/1) ... [2022-07-14 14:59:36,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43248033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:36, skipping insertion in model container [2022-07-14 14:59:36,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:59:36" (1/1) ... [2022-07-14 14:59:36,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 14:59:36,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 14:59:36,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:59:36,905 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 14:59:36,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:59:36,957 INFO L208 MainTranslator]: Completed translation [2022-07-14 14:59:36,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:36 WrapperNode [2022-07-14 14:59:36,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 14:59:36,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 14:59:36,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 14:59:36,959 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 14:59:36,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:36" (1/1) ... [2022-07-14 14:59:36,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:36" (1/1) ... [2022-07-14 14:59:36,990 INFO L137 Inliner]: procedures = 109, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2022-07-14 14:59:36,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 14:59:36,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 14:59:36,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 14:59:36,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 14:59:36,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:36" (1/1) ... [2022-07-14 14:59:36,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:36" (1/1) ... [2022-07-14 14:59:36,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:36" (1/1) ... [2022-07-14 14:59:36,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:36" (1/1) ... [2022-07-14 14:59:37,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:36" (1/1) ... [2022-07-14 14:59:37,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:36" (1/1) ... [2022-07-14 14:59:37,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:36" (1/1) ... [2022-07-14 14:59:37,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 14:59:37,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 14:59:37,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 14:59:37,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 14:59:37,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:36" (1/1) ... [2022-07-14 14:59:37,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:37,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:37,032 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) [2022-07-14 14:59:37,036 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 [2022-07-14 14:59:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 14:59:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 14:59:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 14:59:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 14:59:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 14:59:37,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 14:59:37,102 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 14:59:37,103 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 14:59:37,213 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 14:59:37,217 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 14:59:37,235 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 14:59:37,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:59:37 BoogieIcfgContainer [2022-07-14 14:59:37,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 14:59:37,238 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 14:59:37,238 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 14:59:37,245 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 14:59:37,245 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:59:37,246 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 02:59:36" (1/3) ... [2022-07-14 14:59:37,246 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20de9bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:59:37, skipping insertion in model container [2022-07-14 14:59:37,247 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:59:37,247 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:36" (2/3) ... [2022-07-14 14:59:37,247 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20de9bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:59:37, skipping insertion in model container [2022-07-14 14:59:37,247 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:59:37,247 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:59:37" (3/3) ... [2022-07-14 14:59:37,248 INFO L354 chiAutomizerObserver]: Analyzing ICFG Urban-2013WST-Fig2-alloca.i [2022-07-14 14:59:37,316 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 14:59:37,316 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 14:59:37,316 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 14:59:37,316 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 14:59:37,316 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 14:59:37,316 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 14:59:37,317 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 14:59:37,317 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 14:59:37,320 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) [2022-07-14 14:59:37,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 14:59:37,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:37,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:37,343 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:59:37,343 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 14:59:37,343 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 14:59:37,344 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) [2022-07-14 14:59:37,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 14:59:37,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:37,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:37,346 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:59:37,346 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 14:59:37,350 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem6#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~mem4#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; 6#L549-3true [2022-07-14 14:59:37,350 INFO L754 eck$LassoCheckResult]: Loop: 6#L549-3true call main_#t~mem4#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 2#L549-1true assume !!(main_#t~mem4#1 <= 10);havoc main_#t~mem4#1;call write~int(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 7#L551-3true assume !true; 11#L551-4true call main_#t~mem7#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(1 + main_#t~mem7#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem7#1; 6#L549-3true [2022-07-14 14:59:37,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:37,359 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 14:59:37,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:37,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601919018] [2022-07-14 14:59:37,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:37,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:37,448 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:37,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:37,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:37,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2022-07-14 14:59:37,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:37,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110213424] [2022-07-14 14:59:37,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:37,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:37,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:37,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110213424] [2022-07-14 14:59:37,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110213424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:37,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:37,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:59:37,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218725969] [2022-07-14 14:59:37,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:37,509 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:59:37,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:37,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 14:59:37,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 14:59:37,528 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) [2022-07-14 14:59:37,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:37,531 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-07-14 14:59:37,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 14:59:37,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2022-07-14 14:59:37,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 14:59:37,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2022-07-14 14:59:37,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-14 14:59:37,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-14 14:59:37,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2022-07-14 14:59:37,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:37,538 INFO L369 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-07-14 14:59:37,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2022-07-14 14:59:37,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-07-14 14:59:37,551 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) [2022-07-14 14:59:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2022-07-14 14:59:37,552 INFO L392 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-07-14 14:59:37,552 INFO L374 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-07-14 14:59:37,552 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 14:59:37,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2022-07-14 14:59:37,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 14:59:37,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:37,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:37,552 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:59:37,552 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 14:59:37,553 INFO L752 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;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~mem6#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~mem4#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; 34#L549-3 [2022-07-14 14:59:37,553 INFO L754 eck$LassoCheckResult]: Loop: 34#L549-3 call main_#t~mem4#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 30#L549-1 assume !!(main_#t~mem4#1 <= 10);havoc main_#t~mem4#1;call write~int(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 31#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 35#L551-1 assume !(main_#t~mem5#1 > 1);havoc main_#t~mem5#1; 36#L551-4 call main_#t~mem7#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(1 + main_#t~mem7#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem7#1; 34#L549-3 [2022-07-14 14:59:37,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:37,553 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-14 14:59:37,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:37,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188148802] [2022-07-14 14:59:37,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:37,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:37,564 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:37,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:37,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:37,571 INFO L85 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2022-07-14 14:59:37,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:37,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205679019] [2022-07-14 14:59:37,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:37,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:37,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:37,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:37,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205679019] [2022-07-14 14:59:37,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205679019] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:37,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:37,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 14:59:37,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98506521] [2022-07-14 14:59:37,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:37,606 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:59:37,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:37,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 14:59:37,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 14:59:37,606 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) [2022-07-14 14:59:37,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:37,625 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-07-14 14:59:37,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 14:59:37,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2022-07-14 14:59:37,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-14 14:59:37,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2022-07-14 14:59:37,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-14 14:59:37,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-14 14:59:37,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2022-07-14 14:59:37,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:37,627 INFO L369 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-14 14:59:37,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2022-07-14 14:59:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-07-14 14:59:37,627 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) [2022-07-14 14:59:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-07-14 14:59:37,628 INFO L392 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-14 14:59:37,628 INFO L374 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-14 14:59:37,628 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 14:59:37,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2022-07-14 14:59:37,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-14 14:59:37,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:37,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:37,630 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:59:37,630 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2022-07-14 14:59:37,630 INFO L752 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 58#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~mem6#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~mem4#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; 59#L549-3 [2022-07-14 14:59:37,631 INFO L754 eck$LassoCheckResult]: Loop: 59#L549-3 call main_#t~mem4#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 55#L549-1 assume !!(main_#t~mem4#1 <= 10);havoc main_#t~mem4#1;call write~int(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 56#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 60#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 61#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 63#L551-1 assume !(main_#t~mem5#1 > 1);havoc main_#t~mem5#1; 62#L551-4 call main_#t~mem7#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(1 + main_#t~mem7#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem7#1; 59#L549-3 [2022-07-14 14:59:37,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:37,632 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-14 14:59:37,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:37,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898231952] [2022-07-14 14:59:37,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:37,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:37,646 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:37,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:37,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:37,656 INFO L85 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2022-07-14 14:59:37,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:37,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987152584] [2022-07-14 14:59:37,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:37,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:37,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:37,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987152584] [2022-07-14 14:59:37,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987152584] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:59:37,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098141892] [2022-07-14 14:59:37,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:37,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:59:37,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:37,736 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) [2022-07-14 14:59:37,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 14:59:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:37,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 14:59:37,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:59:37,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-14 14:59:37,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-07-14 14:59:37,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 14:59:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:37,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:59:37,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:37,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098141892] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:59:37,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:59:37,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-07-14 14:59:37,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202193575] [2022-07-14 14:59:37,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:59:37,902 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:59:37,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:37,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 14:59:37,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-14 14:59:37,903 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) [2022-07-14 14:59:37,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:37,971 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-07-14 14:59:37,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 14:59:37,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2022-07-14 14:59:37,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-14 14:59:37,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2022-07-14 14:59:37,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-14 14:59:37,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-14 14:59:37,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2022-07-14 14:59:37,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:37,973 INFO L369 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-07-14 14:59:37,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2022-07-14 14:59:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-14 14:59:37,974 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) [2022-07-14 14:59:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-07-14 14:59:37,975 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-07-14 14:59:37,975 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-07-14 14:59:37,975 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 14:59:37,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2022-07-14 14:59:37,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-14 14:59:37,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:37,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:37,976 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:59:37,976 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1] [2022-07-14 14:59:37,976 INFO L752 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 137#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~mem6#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~mem4#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; 138#L549-3 [2022-07-14 14:59:37,976 INFO L754 eck$LassoCheckResult]: Loop: 138#L549-3 call main_#t~mem4#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 134#L549-1 assume !!(main_#t~mem4#1 <= 10);havoc main_#t~mem4#1;call write~int(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 135#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 139#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 140#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 141#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 148#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 147#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 146#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 145#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 144#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 143#L551-1 assume !(main_#t~mem5#1 > 1);havoc main_#t~mem5#1; 142#L551-4 call main_#t~mem7#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(1 + main_#t~mem7#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem7#1; 138#L549-3 [2022-07-14 14:59:37,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:37,977 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-14 14:59:37,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:37,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127633617] [2022-07-14 14:59:37,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:37,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:37,996 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:38,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:38,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:38,001 INFO L85 PathProgramCache]: Analyzing trace with hash 351922269, now seen corresponding path program 2 times [2022-07-14 14:59:38,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:38,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214354151] [2022-07-14 14:59:38,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:38,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:38,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:38,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214354151] [2022-07-14 14:59:38,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214354151] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:59:38,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744525603] [2022-07-14 14:59:38,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 14:59:38,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:59:38,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:38,144 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) [2022-07-14 14:59:38,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 14:59:38,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 14:59:38,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:59:38,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 14:59:38,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:59:38,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-14 14:59:38,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-07-14 14:59:38,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-07-14 14:59:38,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-07-14 14:59:38,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-07-14 14:59:38,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 14:59:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:38,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:59:38,349 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:38,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744525603] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:59:38,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:59:38,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 17 [2022-07-14 14:59:38,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490169841] [2022-07-14 14:59:38,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:59:38,350 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:59:38,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:38,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-14 14:59:38,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=160, Unknown=0, NotChecked=0, Total=272 [2022-07-14 14:59:38,353 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 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) [2022-07-14 14:59:38,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:38,440 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-14 14:59:38,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 14:59:38,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2022-07-14 14:59:38,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-07-14 14:59:38,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2022-07-14 14:59:38,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-07-14 14:59:38,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-07-14 14:59:38,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2022-07-14 14:59:38,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:38,445 INFO L369 hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-14 14:59:38,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2022-07-14 14:59:38,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-14 14:59:38,446 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) [2022-07-14 14:59:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-07-14 14:59:38,446 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-14 14:59:38,446 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-14 14:59:38,446 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 14:59:38,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2022-07-14 14:59:38,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-07-14 14:59:38,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:38,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:38,447 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:59:38,447 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1] [2022-07-14 14:59:38,447 INFO L752 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 279#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~mem6#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~mem4#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; 280#L549-3 [2022-07-14 14:59:38,447 INFO L754 eck$LassoCheckResult]: Loop: 280#L549-3 call main_#t~mem4#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 276#L549-1 assume !!(main_#t~mem4#1 <= 10);havoc main_#t~mem4#1;call write~int(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 277#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 281#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 282#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 283#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 300#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 299#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 298#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 297#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 296#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 295#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 294#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 293#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 292#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 291#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 290#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 289#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 288#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 287#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 286#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 285#L551-1 assume !(main_#t~mem5#1 > 1);havoc main_#t~mem5#1; 284#L551-4 call main_#t~mem7#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(1 + main_#t~mem7#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem7#1; 280#L549-3 [2022-07-14 14:59:38,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:38,447 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-07-14 14:59:38,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:38,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702662198] [2022-07-14 14:59:38,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:38,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:38,463 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:38,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:38,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:38,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1943458812, now seen corresponding path program 3 times [2022-07-14 14:59:38,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:38,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271927761] [2022-07-14 14:59:38,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:38,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:38,515 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:38,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:38,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:38,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1979445758, now seen corresponding path program 1 times [2022-07-14 14:59:38,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:38,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469574064] [2022-07-14 14:59:38,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:38,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:38,579 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:38,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:41,943 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:59:41,943 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:59:41,944 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:59:41,944 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:59:41,944 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:59:41,944 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:41,944 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:59:41,944 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:59:41,944 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca.i_Iteration5_Lasso [2022-07-14 14:59:41,944 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:59:41,944 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:59:41,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:42,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:42,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:42,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:42,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:42,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:42,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:42,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:42,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:42,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:42,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:42,313 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:59:42,315 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:59:42,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:42,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:42,360 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) [2022-07-14 14:59:42,361 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 [2022-07-14 14:59:42,362 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 [2022-07-14 14:59:42,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:42,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:42,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:42,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:42,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:42,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:42,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:42,386 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:59:42,393 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 14:59:42,394 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-14 14:59:42,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:42,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:42,396 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) [2022-07-14 14:59:42,397 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 [2022-07-14 14:59:42,398 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:59:42,398 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 14:59:42,399 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:59:42,399 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0#1.base) ULTIMATE.start_main_~x1~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0#1.base) ULTIMATE.start_main_~x1~0#1.offset)_1 + 21 Supporting invariants [] [2022-07-14 14:59:42,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:42,450 INFO L293 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2022-07-14 14:59:42,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:42,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 14:59:42,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:59:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:42,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-14 14:59:42,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:59:42,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-14 14:59:42,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-14 14:59:42,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-14 14:59:42,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-14 14:59:42,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:42,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-14 14:59:42,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-14 14:59:42,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-14 14:59:42,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-14 14:59:42,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-14 14:59:42,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-14 14:59:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-14 14:59:42,744 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-14 14:59:42,744 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) [2022-07-14 14:59:42,792 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. [2022-07-14 14:59:42,793 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 [2022-07-14 14:59:42,795 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) [2022-07-14 14:59:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2022-07-14 14:59:42,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 23 letters. [2022-07-14 14:59:42,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:42,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 25 letters. Loop has 23 letters. [2022-07-14 14:59:42,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:42,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 46 letters. [2022-07-14 14:59:42,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:42,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 51 transitions. [2022-07-14 14:59:42,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 14:59:42,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 47 states and 50 transitions. [2022-07-14 14:59:42,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-07-14 14:59:42,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-14 14:59:42,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 50 transitions. [2022-07-14 14:59:42,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:59:42,800 INFO L369 hiAutomatonCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-07-14 14:59:42,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 50 transitions. [2022-07-14 14:59:42,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29. [2022-07-14 14:59:42,801 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) [2022-07-14 14:59:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-07-14 14:59:42,802 INFO L392 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-07-14 14:59:42,802 INFO L374 stractBuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-07-14 14:59:42,802 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 14:59:42,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 32 transitions. [2022-07-14 14:59:42,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 14:59:42,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:42,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:42,803 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 14:59:42,803 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 14:59:42,803 INFO L752 eck$LassoCheckResult]: Stem: 501#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 502#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~mem6#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~mem4#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; 503#L549-3 call main_#t~mem4#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 497#L549-1 assume !!(main_#t~mem4#1 <= 10);havoc main_#t~mem4#1;call write~int(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 498#L551-3 [2022-07-14 14:59:42,803 INFO L754 eck$LassoCheckResult]: Loop: 498#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 505#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 498#L551-3 [2022-07-14 14:59:42,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:42,804 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2022-07-14 14:59:42,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:42,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486017421] [2022-07-14 14:59:42,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:42,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:42,811 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:42,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:42,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:42,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2022-07-14 14:59:42,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:42,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522438572] [2022-07-14 14:59:42,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:42,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:42,822 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:42,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:42,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:42,824 INFO L85 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2022-07-14 14:59:42,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:42,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47275451] [2022-07-14 14:59:42,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:42,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:42,831 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:42,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:43,024 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:59:43,024 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:59:43,024 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:59:43,024 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:59:43,024 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:59:43,024 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:43,024 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:59:43,024 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:59:43,024 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca.i_Iteration6_Lasso [2022-07-14 14:59:43,024 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:59:43,024 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:59:43,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:43,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:43,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:43,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:43,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:43,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:43,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:43,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:43,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:43,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:43,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:43,276 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:59:43,276 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:59:43,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:43,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:43,277 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) [2022-07-14 14:59:43,278 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 [2022-07-14 14:59:43,280 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 [2022-07-14 14:59:43,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:43,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:43,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:43,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:43,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:43,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:43,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:43,305 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:43,322 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 [2022-07-14 14:59:43,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:43,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:43,324 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) [2022-07-14 14:59:43,325 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 [2022-07-14 14:59:43,326 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 [2022-07-14 14:59:43,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:43,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:43,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:43,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:43,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:43,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:43,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:43,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:43,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:43,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:43,372 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) [2022-07-14 14:59:43,373 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 [2022-07-14 14:59:43,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:43,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:43,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:43,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:43,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:43,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:43,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:43,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:43,425 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 [2022-07-14 14:59:43,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:43,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:43,426 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) [2022-07-14 14:59:43,427 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 [2022-07-14 14:59:43,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:43,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:43,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:43,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:43,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:43,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:43,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:43,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:43,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:43,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:43,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:43,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:43,470 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) [2022-07-14 14:59:43,478 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 [2022-07-14 14:59:43,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:43,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:43,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:43,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:43,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:43,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:43,488 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 [2022-07-14 14:59:43,497 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:43,514 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 [2022-07-14 14:59:43,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:43,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:43,516 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) [2022-07-14 14:59:43,517 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 [2022-07-14 14:59:43,518 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 [2022-07-14 14:59:43,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:43,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:43,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:43,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:43,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:43,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:43,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:43,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:43,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:43,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:43,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:43,558 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) [2022-07-14 14:59:43,564 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 [2022-07-14 14:59:43,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:43,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:43,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:43,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:43,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:43,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:43,574 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 [2022-07-14 14:59:43,582 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:43,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:43,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:43,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:43,601 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) [2022-07-14 14:59:43,602 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 [2022-07-14 14:59:43,603 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 [2022-07-14 14:59:43,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:43,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:43,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:43,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:43,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:43,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:43,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:43,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:43,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:43,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:43,648 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) [2022-07-14 14:59:43,649 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 [2022-07-14 14:59:43,650 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 [2022-07-14 14:59:43,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:43,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:43,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:43,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:43,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:43,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:43,672 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:43,690 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 [2022-07-14 14:59:43,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:43,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:43,691 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) [2022-07-14 14:59:43,692 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 [2022-07-14 14:59:43,693 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 [2022-07-14 14:59:43,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:43,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:43,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:43,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:43,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:43,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:43,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:43,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:43,715 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 [2022-07-14 14:59:43,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:43,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:43,717 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) [2022-07-14 14:59:43,717 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 [2022-07-14 14:59:43,721 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 [2022-07-14 14:59:43,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:43,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:43,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:43,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:43,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:43,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:43,739 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:59:43,757 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-14 14:59:43,757 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-07-14 14:59:43,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:43,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:43,758 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) [2022-07-14 14:59:43,758 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 [2022-07-14 14:59:43,760 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:59:43,768 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 14:59:43,769 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:59:43,769 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_2 Supporting invariants [] [2022-07-14 14:59:43,784 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 [2022-07-14 14:59:43,794 INFO L293 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2022-07-14 14:59:43,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:43,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:59:43,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:59:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:43,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 14:59:43,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:59:43,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:43,825 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 14:59:43,825 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) [2022-07-14 14:59:43,834 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 67 states and 72 transitions. Complement of second has 7 states. [2022-07-14 14:59:43,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 14:59:43,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2022-07-14 14:59:43,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-14 14:59:43,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:43,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-14 14:59:43,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:43,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2022-07-14 14:59:43,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:43,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 72 transitions. [2022-07-14 14:59:43,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 14:59:43,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 52 states and 55 transitions. [2022-07-14 14:59:43,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-14 14:59:43,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-14 14:59:43,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 55 transitions. [2022-07-14 14:59:43,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:59:43,837 INFO L369 hiAutomatonCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-07-14 14:59:43,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 55 transitions. [2022-07-14 14:59:43,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-07-14 14:59:43,838 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) [2022-07-14 14:59:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-07-14 14:59:43,839 INFO L392 hiAutomatonCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-07-14 14:59:43,839 INFO L374 stractBuchiCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-07-14 14:59:43,839 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 14:59:43,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 53 transitions. [2022-07-14 14:59:43,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 14:59:43,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:43,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:43,840 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 2, 2, 1, 1, 1, 1] [2022-07-14 14:59:43,840 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 14:59:43,840 INFO L752 eck$LassoCheckResult]: Stem: 671#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 672#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~mem6#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~mem4#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; 673#L549-3 call main_#t~mem4#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 669#L549-1 assume !!(main_#t~mem4#1 <= 10);havoc main_#t~mem4#1;call write~int(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 670#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 679#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 677#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 678#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 716#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 715#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 714#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 713#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 712#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 711#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 710#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 709#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 708#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 707#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 706#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 705#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 704#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 684#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 685#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 681#L551-1 assume !(main_#t~mem5#1 > 1);havoc main_#t~mem5#1; 680#L551-4 call main_#t~mem7#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(1 + main_#t~mem7#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem7#1; 674#L549-3 call main_#t~mem4#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 667#L549-1 assume !!(main_#t~mem4#1 <= 10);havoc main_#t~mem4#1;call write~int(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 668#L551-3 [2022-07-14 14:59:43,840 INFO L754 eck$LassoCheckResult]: Loop: 668#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 676#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 668#L551-3 [2022-07-14 14:59:43,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:43,840 INFO L85 PathProgramCache]: Analyzing trace with hash 423138919, now seen corresponding path program 2 times [2022-07-14 14:59:43,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:43,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167426387] [2022-07-14 14:59:43,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:43,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:43,859 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:43,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:43,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:43,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 2 times [2022-07-14 14:59:43,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:43,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995898697] [2022-07-14 14:59:43,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:43,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:43,875 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:43,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:43,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:43,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1385391412, now seen corresponding path program 3 times [2022-07-14 14:59:43,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:43,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542203712] [2022-07-14 14:59:43,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:43,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:43,894 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:43,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:45,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:49,345 WARN L233 SmtUtils]: Spent 5.41s on a formula simplification. DAG size of input: 184 DAG size of output: 156 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-14 14:59:49,449 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:59:49,449 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:59:49,449 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:59:49,449 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:59:49,449 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:59:49,449 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:49,449 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:59:49,449 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:59:49,449 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca.i_Iteration7_Lasso [2022-07-14 14:59:49,449 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:59:49,449 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:59:49,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:49,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:49,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:49,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:49,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:49,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:49,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:49,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:49,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:49,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:49,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:49,688 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:59:49,688 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:59:49,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:49,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:49,690 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) [2022-07-14 14:59:49,691 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 [2022-07-14 14:59:49,692 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 [2022-07-14 14:59:49,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:49,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:49,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:49,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:49,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:49,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:49,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:49,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:49,714 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 [2022-07-14 14:59:49,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:49,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:49,715 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) [2022-07-14 14:59:49,717 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 [2022-07-14 14:59:49,724 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 [2022-07-14 14:59:49,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:49,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:49,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:49,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:49,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:49,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:49,734 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:49,749 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 [2022-07-14 14:59:49,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:49,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:49,750 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) [2022-07-14 14:59:49,751 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 [2022-07-14 14:59:49,752 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 [2022-07-14 14:59:49,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:49,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:49,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:49,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:49,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:49,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:49,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:49,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:49,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:49,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:49,778 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) [2022-07-14 14:59:49,787 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 [2022-07-14 14:59:49,789 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 [2022-07-14 14:59:49,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:49,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:49,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:49,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:49,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:49,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:49,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:49,822 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 [2022-07-14 14:59:49,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:49,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:49,824 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) [2022-07-14 14:59:49,829 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 [2022-07-14 14:59:49,830 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 [2022-07-14 14:59:49,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:49,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:49,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:49,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:49,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:49,837 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:49,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:49,854 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 [2022-07-14 14:59:49,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:49,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:49,855 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:49,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-14 14:59:49,857 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 [2022-07-14 14:59:49,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:49,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:49,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:49,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:49,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:49,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:49,881 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:49,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:49,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:49,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:49,898 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:49,908 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 [2022-07-14 14:59:49,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:49,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:49,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:49,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:49,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:49,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:49,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-14 14:59:49,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:49,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:49,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:49,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:49,945 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:49,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-14 14:59:49,947 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 [2022-07-14 14:59:49,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:49,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:49,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:49,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:49,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:49,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:49,956 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:49,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:49,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:49,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:49,972 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:49,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-14 14:59:49,973 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 [2022-07-14 14:59:49,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:49,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:49,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:49,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:49,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:49,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:49,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:49,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-14 14:59:49,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:49,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:49,998 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:49,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-14 14:59:50,000 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 [2022-07-14 14:59:50,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:50,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:50,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:50,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:50,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:50,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:50,018 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:59:50,023 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-14 14:59:50,023 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-07-14 14:59:50,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:50,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:50,024 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:50,026 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:59:50,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-14 14:59:50,036 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 14:59:50,036 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:59:50,036 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_3 Supporting invariants [] [2022-07-14 14:59:50,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-14 14:59:50,061 INFO L293 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2022-07-14 14:59:50,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:50,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:59:50,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:59:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:50,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 14:59:50,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:59:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:50,133 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 14:59:50,133 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) [2022-07-14 14:59:50,143 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 62 states and 66 transitions. Complement of second has 7 states. [2022-07-14 14:59:50,143 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 [2022-07-14 14:59:50,143 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) [2022-07-14 14:59:50,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2022-07-14 14:59:50,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 27 letters. Loop has 2 letters. [2022-07-14 14:59:50,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:50,144 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:59:50,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:50,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:59:50,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:59:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:50,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 14:59:50,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:59:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:50,219 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 14:59:50,219 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) [2022-07-14 14:59:50,227 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 62 states and 66 transitions. Complement of second has 7 states. [2022-07-14 14:59:50,227 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 [2022-07-14 14:59:50,228 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) [2022-07-14 14:59:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2022-07-14 14:59:50,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 27 letters. Loop has 2 letters. [2022-07-14 14:59:50,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:50,228 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:59:50,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:50,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:59:50,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:59:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:50,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 14:59:50,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:59:50,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:50,300 INFO L152 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 [2022-07-14 14:59:50,300 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) [2022-07-14 14:59:50,311 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 73 states and 79 transitions. Complement of second has 6 states. [2022-07-14 14:59:50,311 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 [2022-07-14 14:59:50,312 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) [2022-07-14 14:59:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-07-14 14:59:50,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 27 letters. Loop has 2 letters. [2022-07-14 14:59:50,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:50,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 29 letters. Loop has 2 letters. [2022-07-14 14:59:50,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:50,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 27 letters. Loop has 4 letters. [2022-07-14 14:59:50,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:50,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 79 transitions. [2022-07-14 14:59:50,314 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 14:59:50,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 0 states and 0 transitions. [2022-07-14 14:59:50,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 14:59:50,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 14:59:50,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 14:59:50,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:50,314 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 14:59:50,314 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 14:59:50,314 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 14:59:50,314 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 14:59:50,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-14 14:59:50,314 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 14:59:50,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-14 14:59:50,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 02:59:50 BoogieIcfgContainer [2022-07-14 14:59:50,318 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 14:59:50,318 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 14:59:50,318 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 14:59:50,319 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 14:59:50,319 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:59:37" (3/4) ... [2022-07-14 14:59:50,320 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 14:59:50,320 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 14:59:50,321 INFO L158 Benchmark]: Toolchain (without parser) took 13605.31ms. Allocated memory was 88.1MB in the beginning and 142.6MB in the end (delta: 54.5MB). Free memory was 54.4MB in the beginning and 66.8MB in the end (delta: -12.4MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2022-07-14 14:59:50,321 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory was 44.0MB in the beginning and 44.0MB in the end (delta: 28.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:59:50,321 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.38ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 54.3MB in the beginning and 88.3MB in the end (delta: -34.0MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2022-07-14 14:59:50,321 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.79ms. Allocated memory is still 117.4MB. Free memory was 88.3MB in the beginning and 86.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:59:50,321 INFO L158 Benchmark]: Boogie Preprocessor took 14.27ms. Allocated memory is still 117.4MB. Free memory was 86.8MB in the beginning and 85.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 14:59:50,322 INFO L158 Benchmark]: RCFGBuilder took 231.67ms. Allocated memory is still 117.4MB. Free memory was 85.4MB in the beginning and 75.7MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 14:59:50,322 INFO L158 Benchmark]: BuchiAutomizer took 13080.27ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 75.7MB in the beginning and 66.8MB in the end (delta: 8.8MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2022-07-14 14:59:50,322 INFO L158 Benchmark]: Witness Printer took 2.04ms. Allocated memory is still 142.6MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:59:50,323 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory was 44.0MB in the beginning and 44.0MB in the end (delta: 28.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.38ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 54.3MB in the beginning and 88.3MB in the end (delta: -34.0MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.79ms. Allocated memory is still 117.4MB. Free memory was 88.3MB in the beginning and 86.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.27ms. Allocated memory is still 117.4MB. Free memory was 86.8MB in the beginning and 85.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 231.67ms. Allocated memory is still 117.4MB. Free memory was 85.4MB in the beginning and 75.7MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 13080.27ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 75.7MB in the beginning and 66.8MB in the end (delta: 8.8MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. * Witness Printer took 2.04ms. Allocated memory is still 142.6MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. * 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 -2 * unknown-#memory_int-unknown[x1][x1] + 21 and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x2][x2] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x2][x2] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.0s and 8 iterations. TraceHistogramMax:10. Analysis of lassos took 12.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 20 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, 42 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 133 IncrementalHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 53 mSDtfsCounter, 133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital163 mio100 ax111 hnf100 lsp86 ukn65 mio100 lsp38 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms 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! [2022-07-14 14:59:50,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:50,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-14 14:59:50,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-14 14:59:50,957 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