./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/a.09_assume-alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/a.09_assume-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 df4500f5696d99ca846c8b1d02ff521622ca4836 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:34:05,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:34:05,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:34:05,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:34:05,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:34:05,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:34:05,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:34:05,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:34:05,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:34:05,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:34:05,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:34:05,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:34:05,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:34:05,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:34:05,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:34:05,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:34:05,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:34:05,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:34:05,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:34:05,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:34:05,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:34:05,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:34:05,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:34:05,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:34:05,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:34:05,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:34:05,112 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:34:05,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:34:05,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:34:05,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:34:05,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:34:05,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:34:05,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:34:05,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:34:05,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:34:05,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:34:05,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:34:05,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:34:05,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:34:05,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:34:05,123 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:34:05,123 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:34:05,140 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:34:05,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:34:05,142 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:34:05,142 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:34:05,142 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:34:05,143 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:34:05,143 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:34:05,143 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:34:05,143 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:34:05,144 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:34:05,144 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:34:05,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:34:05,145 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:34:05,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:34:05,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:34:05,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:34:05,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:34:05,146 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:34:05,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:34:05,146 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:34:05,147 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:34:05,147 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:34:05,147 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:34:05,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:34:05,148 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:34:05,148 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:34:05,148 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:34:05,149 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:34:05,149 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:34:05,150 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:34:05,150 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> df4500f5696d99ca846c8b1d02ff521622ca4836 [2020-07-29 01:34:05,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:34:05,478 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:34:05,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:34:05,483 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:34:05,484 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:34:05,485 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/a.09_assume-alloca.i [2020-07-29 01:34:05,548 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/731211726/7cdbe982513f467fbca9df20bde763ee/FLAGe4f1944d9 [2020-07-29 01:34:06,034 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:34:06,035 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.09_assume-alloca.i [2020-07-29 01:34:06,048 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/731211726/7cdbe982513f467fbca9df20bde763ee/FLAGe4f1944d9 [2020-07-29 01:34:06,322 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/731211726/7cdbe982513f467fbca9df20bde763ee [2020-07-29 01:34:06,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:34:06,328 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:34:06,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:06,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:34:06,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:34:06,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:06" (1/1) ... [2020-07-29 01:34:06,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65311a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:06, skipping insertion in model container [2020-07-29 01:34:06,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:06" (1/1) ... [2020-07-29 01:34:06,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:34:06,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:34:06,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:06,762 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:34:06,841 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:06,896 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:34:06,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:06 WrapperNode [2020-07-29 01:34:06,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:06,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:06,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:34:06,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:34:06,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:06" (1/1) ... [2020-07-29 01:34:06,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:06" (1/1) ... [2020-07-29 01:34:06,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:06,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:34:06,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:34:06,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:34:06,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:06" (1/1) ... [2020-07-29 01:34:06,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:06" (1/1) ... [2020-07-29 01:34:06,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:06" (1/1) ... [2020-07-29 01:34:06,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:06" (1/1) ... [2020-07-29 01:34:06,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:06" (1/1) ... [2020-07-29 01:34:06,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:06" (1/1) ... [2020-07-29 01:34:06,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:06" (1/1) ... [2020-07-29 01:34:06,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:34:06,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:34:06,986 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:34:06,986 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:34:06,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:07,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:34:07,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:34:07,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:34:07,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:34:07,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:34:07,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:34:07,574 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:34:07,574 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:34:07,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:07 BoogieIcfgContainer [2020-07-29 01:34:07,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:34:07,578 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:34:07,579 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:34:07,582 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:34:07,583 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:07,583 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:34:06" (1/3) ... [2020-07-29 01:34:07,585 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5539274f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:07, skipping insertion in model container [2020-07-29 01:34:07,585 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:07,585 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:06" (2/3) ... [2020-07-29 01:34:07,585 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5539274f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:07, skipping insertion in model container [2020-07-29 01:34:07,586 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:07,586 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:07" (3/3) ... [2020-07-29 01:34:07,588 INFO L371 chiAutomizerObserver]: Analyzing ICFG a.09_assume-alloca.i [2020-07-29 01:34:07,644 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:34:07,645 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:34:07,645 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:34:07,645 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:34:07,646 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:34:07,646 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:34:07,646 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:34:07,646 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:34:07,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 01:34:07,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:07,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:07,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:07,697 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:34:07,697 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:34:07,697 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:34:07,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 01:34:07,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:07,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:07,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:07,701 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:34:07,701 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:34:07,710 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet17, main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~short11, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 11#L555true assume !(test_fun_#t~mem5 <= 0);havoc test_fun_#t~mem5; 5#L558-5true [2020-07-29 01:34:07,711 INFO L796 eck$LassoCheckResult]: Loop: 5#L558-5true call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem7 >= test_fun_#t~mem8; 8#L558-1true assume !test_fun_#t~short11; 12#L558-3true assume !!test_fun_#t~short11;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 14#L559true assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 + test_fun_#t~mem15, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; 5#L558-5true [2020-07-29 01:34:07,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:07,718 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-07-29 01:34:07,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:07,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903449052] [2020-07-29 01:34:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:07,870 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:07,903 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:07,928 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:07,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:07,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1298091, now seen corresponding path program 1 times [2020-07-29 01:34:07,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:07,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618534010] [2020-07-29 01:34:07,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:08,015 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#true} call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem7 >= test_fun_#t~mem8; {18#true} is VALID [2020-07-29 01:34:08,017 INFO L280 TraceCheckUtils]: 1: Hoare triple {18#true} assume !test_fun_#t~short11; {20#(not |ULTIMATE.start_test_fun_#t~short11|)} is VALID [2020-07-29 01:34:08,018 INFO L280 TraceCheckUtils]: 2: Hoare triple {20#(not |ULTIMATE.start_test_fun_#t~short11|)} assume !!test_fun_#t~short11;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {19#false} is VALID [2020-07-29 01:34:08,018 INFO L280 TraceCheckUtils]: 3: Hoare triple {19#false} assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 + test_fun_#t~mem15, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; {19#false} is VALID [2020-07-29 01:34:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:08,022 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618534010] [2020-07-29 01:34:08,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:08,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:34:08,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303487239] [2020-07-29 01:34:08,030 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:34:08,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:08,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:34:08,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:34:08,048 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2020-07-29 01:34:08,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:08,115 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-07-29 01:34:08,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:34:08,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:34:08,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:08,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2020-07-29 01:34:08,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:08,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 7 states and 7 transitions. [2020-07-29 01:34:08,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:34:08,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:34:08,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 7 transitions. [2020-07-29 01:34:08,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:34:08,138 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2020-07-29 01:34:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 7 transitions. [2020-07-29 01:34:08,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-29 01:34:08,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:08,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 7 transitions. Second operand 7 states. [2020-07-29 01:34:08,165 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 7 transitions. Second operand 7 states. [2020-07-29 01:34:08,166 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2020-07-29 01:34:08,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:08,168 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2020-07-29 01:34:08,168 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2020-07-29 01:34:08,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:08,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:08,169 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states and 7 transitions. [2020-07-29 01:34:08,170 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states and 7 transitions. [2020-07-29 01:34:08,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:08,171 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2020-07-29 01:34:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2020-07-29 01:34:08,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:08,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:08,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:08,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:34:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2020-07-29 01:34:08,174 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2020-07-29 01:34:08,174 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2020-07-29 01:34:08,175 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:34:08,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 7 transitions. [2020-07-29 01:34:08,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:08,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:08,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:08,176 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:34:08,176 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:34:08,176 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 34#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet17, main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~short11, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 35#L555 assume !(test_fun_#t~mem5 <= 0);havoc test_fun_#t~mem5; 36#L558-5 [2020-07-29 01:34:08,177 INFO L796 eck$LassoCheckResult]: Loop: 36#L558-5 call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem7 >= test_fun_#t~mem8; 37#L558-1 assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem10 <= 2147483647 - test_fun_#t~mem9; 39#L558-3 assume !!test_fun_#t~short11;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 40#L559 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 + test_fun_#t~mem15, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; 36#L558-5 [2020-07-29 01:34:08,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:08,177 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2020-07-29 01:34:08,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:08,178 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207686289] [2020-07-29 01:34:08,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:08,199 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:08,219 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:08,225 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:08,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:08,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1296169, now seen corresponding path program 1 times [2020-07-29 01:34:08,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:08,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089540078] [2020-07-29 01:34:08,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:08,239 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:08,255 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:08,265 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:08,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905932, now seen corresponding path program 1 times [2020-07-29 01:34:08,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:08,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013077867] [2020-07-29 01:34:08,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:08,335 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:08,374 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:08,381 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:08,566 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:34:09,146 WARN L193 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2020-07-29 01:34:09,365 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-07-29 01:34:09,382 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:09,383 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:09,383 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:09,383 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:09,384 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:09,384 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:09,384 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:09,384 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:09,384 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.09_assume-alloca.i_Iteration2_Lasso [2020-07-29 01:34:09,385 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:09,385 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:09,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:09,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:09,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:09,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:09,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:09,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:09,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:09,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:09,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:09,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:09,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:09,972 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2020-07-29 01:34:10,157 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-07-29 01:34:10,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:10,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:10,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:10,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:10,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:10,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:10,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:10,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:10,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:10,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:10,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:10,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:11,220 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:11,226 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:11,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:11,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,283 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:11,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,312 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:11,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:11,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:11,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:11,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:11,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:11,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:11,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:11,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:11,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,509 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:11,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:11,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:11,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:11,613 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:11,686 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2020-07-29 01:34:11,686 INFO L444 ModelExtractionUtils]: 11 out of 40 variables were initially zero. Simplification set additionally 24 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:11,708 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,747 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:34:11,748 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:11,749 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~y, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = 4294967293*ULTIMATE.start_test_fun_~y - 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 Supporting invariants [1*ULTIMATE.start_test_fun_~y - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 >= 0] [2020-07-29 01:34:12,006 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2020-07-29 01:34:12,019 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem7 >= test_fun_#t~mem8;" "assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem10 <= 2147483647 - test_fun_#t~mem9;" "assume !!test_fun_#t~short11;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 + test_fun_#t~mem15, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;" [2020-07-29 01:34:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:12,048 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:12,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:12,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:34:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:12,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:12,228 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 12 [2020-07-29 01:34:12,243 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:12,255 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:12,315 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:12,315 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 76 [2020-07-29 01:34:12,316 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:12,374 INFO L624 ElimStorePlain]: treesize reduction 39, result has 54.1 percent of original size [2020-07-29 01:34:12,384 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:12,384 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:72, output treesize:13 [2020-07-29 01:34:12,390 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:12,391 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_49|, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_test_fun_~z, |v_#valid_77|, |ULTIMATE.start_test_fun_#t~malloc2.base|]. (and (= (let ((.cse0 (let ((.cse1 (store |v_#memory_int_49| ULTIMATE.start_test_fun_~x_ref~0.base (store (select |v_#memory_int_49| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset ULTIMATE.start_test_fun_~x)))) (store .cse1 ULTIMATE.start_test_fun_~y_ref~0.base (store (select .cse1 ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~y))))) (store .cse0 ULTIMATE.start_test_fun_~z_ref~0.base (store (select .cse0 ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset ULTIMATE.start_test_fun_~z))) |#memory_int|) unseeded (<= (select (store (store |v_#valid_77| |ULTIMATE.start_test_fun_#t~malloc2.base| 1) ULTIMATE.start_test_fun_~y_ref~0.base 1) ULTIMATE.start_test_fun_~z_ref~0.base) 0)) [2020-07-29 01:34:12,391 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_test_fun_~y (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) unseeded (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base))) [2020-07-29 01:34:12,411 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {64#unseeded} is VALID [2020-07-29 01:34:12,415 INFO L280 TraceCheckUtils]: 1: Hoare triple {64#unseeded} havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet17, main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~short11, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {216#(and (= ULTIMATE.start_test_fun_~y (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) unseeded (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} is VALID [2020-07-29 01:34:12,416 INFO L280 TraceCheckUtils]: 2: Hoare triple {216#(and (= ULTIMATE.start_test_fun_~y (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) unseeded (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} assume !(test_fun_#t~mem5 <= 0);havoc test_fun_#t~mem5; {204#(and (>= (+ ULTIMATE.start_test_fun_~y (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) 0) unseeded (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} is VALID [2020-07-29 01:34:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:12,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:34:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:12,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:12,554 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:12,603 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:12,725 INFO L280 TraceCheckUtils]: 0: Hoare triple {205#(and (>= oldRank0 (+ (* 4294967293 ULTIMATE.start_test_fun_~y) (* (- 2) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))) (>= (+ ULTIMATE.start_test_fun_~y (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) 0) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem7 >= test_fun_#t~mem8; {205#(and (>= oldRank0 (+ (* 4294967293 ULTIMATE.start_test_fun_~y) (* (- 2) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))) (>= (+ ULTIMATE.start_test_fun_~y (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) 0) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} is VALID [2020-07-29 01:34:12,727 INFO L280 TraceCheckUtils]: 1: Hoare triple {205#(and (>= oldRank0 (+ (* 4294967293 ULTIMATE.start_test_fun_~y) (* (- 2) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))) (>= (+ ULTIMATE.start_test_fun_~y (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) 0) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem10 <= 2147483647 - test_fun_#t~mem9; {223#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) ULTIMATE.start_test_fun_~y) (or (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483647) (not |ULTIMATE.start_test_fun_#t~short11|)) (<= (* 4294967293 ULTIMATE.start_test_fun_~y) (+ oldRank0 (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} is VALID [2020-07-29 01:34:12,728 INFO L280 TraceCheckUtils]: 2: Hoare triple {223#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) ULTIMATE.start_test_fun_~y) (or (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483647) (not |ULTIMATE.start_test_fun_#t~short11|)) (<= (* 4294967293 ULTIMATE.start_test_fun_~y) (+ oldRank0 (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} assume !!test_fun_#t~short11;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {227#(and (<= |ULTIMATE.start_test_fun_#t~mem12| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) ULTIMATE.start_test_fun_~y) (<= (* 4294967293 ULTIMATE.start_test_fun_~y) (+ oldRank0 (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483647) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} is VALID [2020-07-29 01:34:12,733 INFO L280 TraceCheckUtils]: 3: Hoare triple {227#(and (<= |ULTIMATE.start_test_fun_#t~mem12| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) ULTIMATE.start_test_fun_~y) (<= (* 4294967293 ULTIMATE.start_test_fun_~y) (+ oldRank0 (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483647) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 + test_fun_#t~mem15, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; {207#(and (or unseeded (and (> oldRank0 (+ (* 4294967293 ULTIMATE.start_test_fun_~y) (* (- 2) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))) (>= oldRank0 0))) (>= (+ ULTIMATE.start_test_fun_~y (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) 0) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} is VALID [2020-07-29 01:34:12,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:12,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:34:12,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:12,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:12,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,763 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-07-29 01:34:12,764 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 7 transitions. cyclomatic complexity: 1 Second operand 6 states. [2020-07-29 01:34:12,926 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 7 transitions. cyclomatic complexity: 1. Second operand 6 states. Result 11 states and 12 transitions. Complement of second has 9 states. [2020-07-29 01:34:12,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:12,927 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:12,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 7 transitions. cyclomatic complexity: 1 [2020-07-29 01:34:12,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:12,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:12,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:34:12,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:12,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:12,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:12,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2020-07-29 01:34:12,930 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:34:12,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:34:12,936 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 7 transitions. cyclomatic complexity: 1 [2020-07-29 01:34:12,938 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:34:12,938 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:34:12,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:12,940 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:34:12,940 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 12 transitions. cyclomatic complexity: 2 [2020-07-29 01:34:12,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. cyclomatic complexity: 2 [2020-07-29 01:34:12,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:34:12,941 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:34:12,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 7 transitions. cyclomatic complexity: 1 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:12,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:12,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:12,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 7 transitions. cyclomatic complexity: 1 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:12,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:12,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:12,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 7 transitions. cyclomatic complexity: 1 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:12,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:12,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:12,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 7 transitions. cyclomatic complexity: 1 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:34:12,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:34:12,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:34:12,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 7 transitions. cyclomatic complexity: 1 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:12,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:12,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:12,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 7 transitions. cyclomatic complexity: 1 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:12,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:12,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:12,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 7 transitions. cyclomatic complexity: 1 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:12,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:12,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:12,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 7 transitions. cyclomatic complexity: 1 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:12,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:12,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:12,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 7 transitions. cyclomatic complexity: 1 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:12,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:12,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:12,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 7 transitions. cyclomatic complexity: 1 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:12,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:12,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:12,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,960 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:12,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:34:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2020-07-29 01:34:12,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:12,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:12,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 3 letters. Loop has 8 letters. [2020-07-29 01:34:12,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:12,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. cyclomatic complexity: 2 [2020-07-29 01:34:12,973 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:34:12,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2020-07-29 01:34:12,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:34:12,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:34:12,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:34:12,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:34:12,974 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:12,975 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:12,975 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:12,975 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:34:12,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:34:12,975 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:34:12,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:34:12,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:34:12 BoogieIcfgContainer [2020-07-29 01:34:12,983 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:34:12,984 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:34:12,984 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:34:12,984 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:34:12,985 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:07" (3/4) ... [2020-07-29 01:34:12,993 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:34:12,993 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:34:12,996 INFO L168 Benchmark]: Toolchain (without parser) took 6669.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.8 MB). Free memory was 956.2 MB in the beginning and 1.2 GB in the end (delta: -272.5 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:12,997 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:34:13,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 568.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:13,005 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:13,005 INFO L168 Benchmark]: Boogie Preprocessor took 33.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:34:13,006 INFO L168 Benchmark]: RCFGBuilder took 592.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:13,007 INFO L168 Benchmark]: BuchiAutomizer took 5405.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 150.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -137.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:13,008 INFO L168 Benchmark]: Witness Printer took 9.41 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:34:13,022 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 568.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 592.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5405.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 150.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -137.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Witness Printer took 9.41 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 4294967293 * y + -2 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 7 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 17 SDtfs, 3 SDslu, 10 SDs, 0 SdLazy, 16 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital304 mio100 ax105 hnf99 lsp90 ukn65 mio100 lsp36 div100 bol100 ite100 ukn100 eq179 hnf88 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...