./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/HarrisLalNoriRajamani-2010SAS-Fig1-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 cb5770b8d32c05b82025135c2b222cf31b0a4100 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:32:42,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:32:42,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:32:42,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:32:42,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:32:42,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:32:42,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:32:42,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:32:42,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:32:42,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:32:42,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:32:42,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:32:42,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:32:42,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:32:42,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:32:42,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:32:42,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:32:42,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:32:42,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:32:42,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:32:42,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:32:42,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:32:42,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:32:42,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:32:42,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:32:42,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:32:42,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:32:42,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:32:42,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:32:42,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:32:42,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:32:42,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:32:42,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:32:42,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:32:42,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:32:42,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:32:42,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:32:42,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:32:42,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:32:42,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:32:42,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:32:42,246 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:32:42,263 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:32:42,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:32:42,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:32:42,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:32:42,265 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:32:42,266 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:32:42,266 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:32:42,266 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:32:42,266 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:32:42,267 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:32:42,267 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:32:42,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:32:42,268 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:32:42,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:32:42,268 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:32:42,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:32:42,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:32:42,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:32:42,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:32:42,270 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:32:42,270 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:32:42,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:32:42,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:32:42,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:32:42,272 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:32:42,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:32:42,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:32:42,273 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:32:42,274 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:32:42,275 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:32:42,275 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 -> cb5770b8d32c05b82025135c2b222cf31b0a4100 [2019-11-28 20:32:42,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:32:42,603 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:32:42,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:32:42,608 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:32:42,608 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:32:42,609 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2019-11-28 20:32:42,668 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f8983b82/8c053a844d894023b585a0a6251d1096/FLAG3d6d002c9 [2019-11-28 20:32:43,202 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:32:43,203 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2019-11-28 20:32:43,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f8983b82/8c053a844d894023b585a0a6251d1096/FLAG3d6d002c9 [2019-11-28 20:32:43,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f8983b82/8c053a844d894023b585a0a6251d1096 [2019-11-28 20:32:43,505 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:32:43,507 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:32:43,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:32:43,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:32:43,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:32:43,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:32:43" (1/1) ... [2019-11-28 20:32:43,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dafe6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:32:43, skipping insertion in model container [2019-11-28 20:32:43,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:32:43" (1/1) ... [2019-11-28 20:32:43,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:32:43,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:32:43,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:32:43,972 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:32:44,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:32:44,079 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:32:44,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:32:44 WrapperNode [2019-11-28 20:32:44,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:32:44,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:32:44,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:32:44,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:32:44,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:32:44" (1/1) ... [2019-11-28 20:32:44,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:32:44" (1/1) ... [2019-11-28 20:32:44,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:32:44,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:32:44,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:32:44,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:32:44,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:32:44" (1/1) ... [2019-11-28 20:32:44,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:32:44" (1/1) ... [2019-11-28 20:32:44,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:32:44" (1/1) ... [2019-11-28 20:32:44,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:32:44" (1/1) ... [2019-11-28 20:32:44,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:32:44" (1/1) ... [2019-11-28 20:32:44,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:32:44" (1/1) ... [2019-11-28 20:32:44,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:32:44" (1/1) ... [2019-11-28 20:32:44,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:32:44,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:32:44,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:32:44,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:32:44,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:32:44" (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 [2019-11-28 20:32:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:32:44,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:32:44,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:32:44,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:32:44,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:32:44,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:32:44,779 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:32:44,779 INFO L287 CfgBuilder]: Removed 12 assume(true) statements. [2019-11-28 20:32:44,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:32:44 BoogieIcfgContainer [2019-11-28 20:32:44,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:32:44,782 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:32:44,782 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:32:44,786 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:32:44,787 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:32:44,787 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:32:43" (1/3) ... [2019-11-28 20:32:44,789 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51be15d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:32:44, skipping insertion in model container [2019-11-28 20:32:44,789 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:32:44,789 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:32:44" (2/3) ... [2019-11-28 20:32:44,790 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51be15d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:32:44, skipping insertion in model container [2019-11-28 20:32:44,790 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:32:44,790 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:32:44" (3/3) ... [2019-11-28 20:32:44,792 INFO L371 chiAutomizerObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2019-11-28 20:32:44,846 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:32:44,847 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:32:44,847 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:32:44,847 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:32:44,848 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:32:44,848 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:32:44,848 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:32:44,848 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:32:44,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-28 20:32:44,886 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-28 20:32:44,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:32:44,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:32:44,893 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:32:44,893 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:32:44,893 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:32:44,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-28 20:32:44,896 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-28 20:32:44,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:32:44,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:32:44,897 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:32:44,897 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:32:44,903 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 14#L-1true havoc main_#res;havoc main_#t~nondet21; 8#L578true assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 3#L558true assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 23#L562-2true [2019-11-28 20:32:44,904 INFO L796 eck$LassoCheckResult]: Loop: 23#L562-2true call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 18#L562true assume !!(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9;call f_#t~mem10 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(2 * f_#t~mem10, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem10; 23#L562-2true [2019-11-28 20:32:44,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:32:44,909 INFO L82 PathProgramCache]: Analyzing trace with hash 925608, now seen corresponding path program 1 times [2019-11-28 20:32:44,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:32:44,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407184258] [2019-11-28 20:32:44,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:32:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:45,220 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:32:45,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:32:45,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1446, now seen corresponding path program 1 times [2019-11-28 20:32:45,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:32:45,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189707462] [2019-11-28 20:32:45,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:32:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:45,243 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:32:45,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:32:45,245 INFO L82 PathProgramCache]: Analyzing trace with hash 889509773, now seen corresponding path program 1 times [2019-11-28 20:32:45,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:32:45,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099422788] [2019-11-28 20:32:45,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:32:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:32:45,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:32:45,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099422788] [2019-11-28 20:32:45,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:32:45,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:32:45,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878829700] [2019-11-28 20:32:45,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:32:45,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:32:45,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:32:45,585 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2019-11-28 20:32:45,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:32:45,769 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2019-11-28 20:32:45,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:32:45,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2019-11-28 20:32:45,780 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 20:32:45,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 29 states and 38 transitions. [2019-11-28 20:32:45,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-28 20:32:45,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-28 20:32:45,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2019-11-28 20:32:45,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:32:45,798 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-11-28 20:32:45,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2019-11-28 20:32:45,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2019-11-28 20:32:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 20:32:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-28 20:32:45,837 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-28 20:32:45,837 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-28 20:32:45,838 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:32:45,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-11-28 20:32:45,843 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 20:32:45,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:32:45,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:32:45,845 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:32:45,845 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:32:45,847 INFO L794 eck$LassoCheckResult]: Stem: 93#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 92#L-1 havoc main_#res;havoc main_#t~nondet21; 85#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 78#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 79#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 94#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 81#L567-2 [2019-11-28 20:32:45,848 INFO L796 eck$LassoCheckResult]: Loop: 81#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 89#L566 assume !f_#t~short13; 90#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 86#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 81#L567-2 [2019-11-28 20:32:45,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:32:45,849 INFO L82 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 1 times [2019-11-28 20:32:45,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:32:45,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796470556] [2019-11-28 20:32:45,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:32:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:45,999 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:32:46,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:32:46,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1759853, now seen corresponding path program 1 times [2019-11-28 20:32:46,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:32:46,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644580439] [2019-11-28 20:32:46,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:32:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:32:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:32:46,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644580439] [2019-11-28 20:32:46,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:32:46,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:32:46,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549257822] [2019-11-28 20:32:46,017 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:32:46,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:32:46,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:32:46,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:32:46,018 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-28 20:32:46,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:32:46,053 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-11-28 20:32:46,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:32:46,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2019-11-28 20:32:46,056 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 20:32:46,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2019-11-28 20:32:46,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-28 20:32:46,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-28 20:32:46,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2019-11-28 20:32:46,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:32:46,058 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-28 20:32:46,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2019-11-28 20:32:46,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-28 20:32:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 20:32:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-11-28 20:32:46,060 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-28 20:32:46,061 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-28 20:32:46,061 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:32:46,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2019-11-28 20:32:46,062 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 20:32:46,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:32:46,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:32:46,062 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:32:46,062 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:32:46,063 INFO L794 eck$LassoCheckResult]: Stem: 139#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 137#L-1 havoc main_#res;havoc main_#t~nondet21; 131#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 124#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 125#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 140#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 127#L567-2 [2019-11-28 20:32:46,063 INFO L796 eck$LassoCheckResult]: Loop: 127#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 135#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 136#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 132#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 127#L567-2 [2019-11-28 20:32:46,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:32:46,063 INFO L82 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 2 times [2019-11-28 20:32:46,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:32:46,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165705722] [2019-11-28 20:32:46,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:32:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:46,129 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:32:46,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:32:46,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1757931, now seen corresponding path program 1 times [2019-11-28 20:32:46,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:32:46,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863231758] [2019-11-28 20:32:46,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:32:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:46,144 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:32:46,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:32:46,145 INFO L82 PathProgramCache]: Analyzing trace with hash -260778635, now seen corresponding path program 1 times [2019-11-28 20:32:46,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:32:46,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037768184] [2019-11-28 20:32:46,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:32:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:46,195 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:32:46,342 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-11-28 20:32:47,706 WARN L192 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 159 DAG size of output: 123 [2019-11-28 20:32:48,203 WARN L192 SmtUtils]: Spent 490.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-11-28 20:32:48,219 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:32:48,220 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:32:48,220 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:32:48,221 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:32:48,221 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:32:48,221 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:48,221 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:32:48,222 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:32:48,222 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i_Iteration3_Lasso [2019-11-28 20:32:48,222 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:32:48,222 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:32:48,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:48,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:48,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:48,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:48,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:48,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:48,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:48,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:49,229 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 92 [2019-11-28 20:32:49,453 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-11-28 20:32:49,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:49,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:49,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:49,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:49,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:49,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:49,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:49,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:49,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:49,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:49,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:49,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:49,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:49,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:49,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:49,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:49,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:50,281 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:32:50,287 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) [2019-11-28 20:32:50,296 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 [2019-11-28 20:32:50,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:50,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:32:50,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:50,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:50,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:50,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:32:50,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:50,311 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) [2019-11-28 20:32:50,327 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 [2019-11-28 20:32:50,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:50,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:50,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:50,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:50,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:50,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:50,338 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 [2019-11-28 20:32:50,350 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 [2019-11-28 20:32:50,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:50,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:32:50,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:50,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:50,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:50,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:32:50,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:32:50,360 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) [2019-11-28 20:32:50,383 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 [2019-11-28 20:32:50,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:50,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:32:50,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:50,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:50,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:50,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:32:50,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:50,388 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:50,403 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 [2019-11-28 20:32:50,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:50,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:32:50,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:50,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:50,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:50,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:32:50,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:32:50,411 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 [2019-11-28 20:32:50,418 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 [2019-11-28 20:32:50,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:50,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:50,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:50,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:50,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:50,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:32:50,435 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 [2019-11-28 20:32:50,448 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 [2019-11-28 20:32:50,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:50,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:32:50,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:50,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:50,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:50,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:32:50,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:32:50,454 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) [2019-11-28 20:32:50,473 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 [2019-11-28 20:32:50,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:50,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:50,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:50,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:50,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:50,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:32:50,489 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 [2019-11-28 20:32:50,495 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 [2019-11-28 20:32:50,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:50,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:50,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:50,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:50,506 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:50,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:32:50,515 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 [2019-11-28 20:32:50,523 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 [2019-11-28 20:32:50,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:50,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:50,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:50,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:50,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:50,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:32:50,533 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 [2019-11-28 20:32:50,539 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 [2019-11-28 20:32:50,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:50,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:50,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:50,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:50,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:50,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:32:50,581 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 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:50,600 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 [2019-11-28 20:32:50,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:50,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:50,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:50,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:50,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:50,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:32:50,612 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 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:50,626 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 [2019-11-28 20:32:50,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:50,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:50,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:50,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:50,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:50,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:32:50,638 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 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:50,644 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 [2019-11-28 20:32:50,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:50,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:50,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:50,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:50,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:50,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:32:50,658 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:32:50,680 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 [2019-11-28 20:32:50,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:50,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:50,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:50,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:50,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:50,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:50,701 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:32:50,805 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-28 20:32:50,805 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:32:50,862 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:50,882 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 20:32:50,882 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:32:50,883 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_1 - 1 >= 0] [2019-11-28 20:32:51,260 INFO L297 tatePredicateManager]: 60 out of 64 supporting invariants were superfluous and have been removed [2019-11-28 20:32:51,278 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:32:51,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:32:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:32:51,352 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-28 20:32:51,355 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:32:51,511 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:32:51,512 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 101 [2019-11-28 20:32:51,513 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:32:51,612 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:32:51,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:32:51,682 INFO L343 Elim1Store]: treesize reduction 107, result has 12.3 percent of original size [2019-11-28 20:32:51,683 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 251 treesize of output 36 [2019-11-28 20:32:51,683 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:32:51,729 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:32:51,732 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-28 20:32:51,732 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:312, output treesize:70 [2019-11-28 20:32:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:32:51,841 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 20:32:51,842 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:32:51,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:32:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:32:51,928 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 [2019-11-28 20:32:51,929 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-11-28 20:32:52,098 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 29 states and 34 transitions. Complement of second has 10 states. [2019-11-28 20:32:52,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:32:52,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 20:32:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-28 20:32:52,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 20:32:52,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:32:52,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-28 20:32:52,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:32:52,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2019-11-28 20:32:52,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:32:52,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2019-11-28 20:32:52,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 20:32:52,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 33 transitions. [2019-11-28 20:32:52,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-28 20:32:52,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-28 20:32:52,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2019-11-28 20:32:52,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:32:52,113 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-28 20:32:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2019-11-28 20:32:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-11-28 20:32:52,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 20:32:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-11-28 20:32:52,121 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-28 20:32:52,121 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-28 20:32:52,121 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:32:52,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2019-11-28 20:32:52,122 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 20:32:52,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:32:52,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:32:52,124 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:32:52,124 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:32:52,125 INFO L794 eck$LassoCheckResult]: Stem: 515#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 512#L-1 havoc main_#res;havoc main_#t~nondet21; 501#L578 assume !(0 != main_#t~nondet21);havoc main_#t~nondet21;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 498#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 499#L562-5 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 500#L562-3 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 506#L567-5 [2019-11-28 20:32:52,125 INFO L796 eck$LassoCheckResult]: Loop: 506#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 518#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 519#L566-7 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 514#L567-3 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 506#L567-5 [2019-11-28 20:32:52,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:32:52,125 INFO L82 PathProgramCache]: Analyzing trace with hash 890987403, now seen corresponding path program 1 times [2019-11-28 20:32:52,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:32:52,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861314842] [2019-11-28 20:32:52,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:32:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:52,205 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:32:52,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:32:52,206 INFO L82 PathProgramCache]: Analyzing trace with hash 3235563, now seen corresponding path program 1 times [2019-11-28 20:32:52,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:32:52,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956628415] [2019-11-28 20:32:52,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:32:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:52,233 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:32:52,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:32:52,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1434718859, now seen corresponding path program 1 times [2019-11-28 20:32:52,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:32:52,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498813794] [2019-11-28 20:32:52,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:32:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:52,270 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:32:53,591 WARN L192 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 159 DAG size of output: 123 [2019-11-28 20:32:53,967 WARN L192 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-28 20:32:53,971 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:32:53,972 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:32:53,972 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:32:53,972 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:32:53,972 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:32:53,972 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:53,973 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:32:53,973 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:32:53,973 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i_Iteration4_Lasso [2019-11-28 20:32:53,973 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:32:53,973 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:32:53,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:53,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:53,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:53,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:53,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:53,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:53,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:53,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:53,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:53,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:53,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:54,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:54,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:54,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:54,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:54,816 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2019-11-28 20:32:55,043 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-11-28 20:32:55,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:55,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:55,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:55,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:55,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:55,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:55,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:55,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:55,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:55,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:32:55,858 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:32:55,858 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:55,868 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 [2019-11-28 20:32:55,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:55,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:32:55,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:55,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:55,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:55,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:32:55,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:32:55,872 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 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:55,879 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 [2019-11-28 20:32:55,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:55,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:32:55,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:55,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:55,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:55,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:32:55,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:32:55,882 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 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:55,889 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 [2019-11-28 20:32:55,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:55,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:32:55,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:55,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:55,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:55,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:32:55,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:32:55,900 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 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:55,906 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 [2019-11-28 20:32:55,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:55,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:55,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:55,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:55,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:55,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:32:55,913 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 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:55,920 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 [2019-11-28 20:32:55,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:55,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:32:55,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:55,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:55,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:55,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:32:55,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:32:55,929 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 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:55,938 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 [2019-11-28 20:32:55,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:55,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:55,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:55,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:55,942 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:55,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:32:55,946 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 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:55,953 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 [2019-11-28 20:32:55,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:55,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:32:55,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:55,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:55,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:55,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:32:55,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:32:55,957 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 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:55,964 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 [2019-11-28 20:32:55,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:55,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:32:55,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:55,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:55,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:55,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:32:55,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:32:55,967 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 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:55,974 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 [2019-11-28 20:32:55,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:55,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:55,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:55,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:55,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:55,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:32:55,979 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 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:55,986 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 [2019-11-28 20:32:55,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:55,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:32:55,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:55,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:55,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:55,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:32:55,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:32:55,990 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 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:55,997 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 [2019-11-28 20:32:55,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:55,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:55,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:55,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:56,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:56,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:32:56,003 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 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:56,009 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 [2019-11-28 20:32:56,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:56,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:32:56,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:56,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:56,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:56,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:32:56,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:32:56,012 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 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:56,018 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 [2019-11-28 20:32:56,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:56,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:32:56,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:56,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:56,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:56,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:32:56,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:32:56,022 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 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:56,029 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 [2019-11-28 20:32:56,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:56,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:56,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:56,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:56,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:56,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:32:56,035 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 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:56,051 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 [2019-11-28 20:32:56,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:56,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:56,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:56,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:56,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:56,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:32:56,057 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:32:56,070 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 [2019-11-28 20:32:56,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:56,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:56,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:56,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:56,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:56,076 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:56,084 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 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:56,092 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 [2019-11-28 20:32:56,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:56,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:56,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:56,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:56,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:56,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:32:56,100 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 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:56,106 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 [2019-11-28 20:32:56,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:56,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:56,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:56,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:56,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:56,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:32:56,139 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 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:56,148 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 [2019-11-28 20:32:56,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:56,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:56,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:56,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:56,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:56,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:32:56,185 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 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:56,193 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 [2019-11-28 20:32:56,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:32:56,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:32:56,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:32:56,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:32:56,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:32:56,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:32:56,208 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:32:56,218 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 20:32:56,218 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:32:56,222 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:32:56,224 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 20:32:56,225 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:32:56,225 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_2 - 2 >= 0] [2019-11-28 20:32:56,516 INFO L297 tatePredicateManager]: 55 out of 59 supporting invariants were superfluous and have been removed [2019-11-28 20:32:56,523 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:32:56,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:32:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:32:56,578 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-28 20:32:56,579 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:32:56,689 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:32:56,689 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 101 [2019-11-28 20:32:56,690 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:32:56,769 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:32:56,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:32:56,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:32:56,785 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 36 [2019-11-28 20:32:56,786 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:32:56,834 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:32:56,837 INFO L534 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-11-28 20:32:56,837 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:312, output treesize:83 [2019-11-28 20:32:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:32:56,897 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 20:32:56,898 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:32:56,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:32:56,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:32:56,966 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 [2019-11-28 20:32:56,966 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-28 20:32:57,201 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 37 states and 44 transitions. Complement of second has 10 states. [2019-11-28 20:32:57,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:32:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 20:32:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-28 20:32:57,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 20:32:57,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:32:57,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-28 20:32:57,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:32:57,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2019-11-28 20:32:57,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:32:57,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2019-11-28 20:32:57,205 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 20:32:57,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 43 transitions. [2019-11-28 20:32:57,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-28 20:32:57,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-28 20:32:57,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2019-11-28 20:32:57,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:32:57,207 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-11-28 20:32:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2019-11-28 20:32:57,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-11-28 20:32:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 20:32:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-11-28 20:32:57,210 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-28 20:32:57,211 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-28 20:32:57,211 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:32:57,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2019-11-28 20:32:57,212 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 20:32:57,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:32:57,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:32:57,213 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:32:57,213 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:32:57,213 INFO L794 eck$LassoCheckResult]: Stem: 882#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 881#L-1 havoc main_#res;havoc main_#t~nondet21; 867#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 860#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 861#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 886#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 887#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 873#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 874#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 868#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 862#L568 [2019-11-28 20:32:57,213 INFO L796 eck$LassoCheckResult]: Loop: 862#L568 call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4);call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4);havoc f_#t~mem15;havoc f_#t~mem16;call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~nondet17;call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem18; 863#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 877#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 892#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 891#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 862#L568 [2019-11-28 20:32:57,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:32:57,214 INFO L82 PathProgramCache]: Analyzing trace with hash -260778639, now seen corresponding path program 1 times [2019-11-28 20:32:57,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:32:57,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463321400] [2019-11-28 20:32:57,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:32:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:57,271 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:32:57,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:32:57,272 INFO L82 PathProgramCache]: Analyzing trace with hash 69174960, now seen corresponding path program 1 times [2019-11-28 20:32:57,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:32:57,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142396691] [2019-11-28 20:32:57,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:32:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:57,292 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:32:57,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:32:57,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1938200384, now seen corresponding path program 1 times [2019-11-28 20:32:57,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:32:57,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914515063] [2019-11-28 20:32:57,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:32:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:32:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:32:57,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914515063] [2019-11-28 20:32:57,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273850354] [2019-11-28 20:32:57,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:32:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:32:57,746 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-28 20:32:57,748 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:32:57,847 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:32:57,848 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 101 [2019-11-28 20:32:57,849 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:32:57,931 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:32:57,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 36 [2019-11-28 20:32:57,940 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:32:57,979 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:32:57,980 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:32:57,981 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:308, output treesize:82 [2019-11-28 20:32:58,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:32:58,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:32:58,066 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 57 [2019-11-28 20:32:58,067 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:32:58,096 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:32:58,098 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 20:32:58,098 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:237, output treesize:53 [2019-11-28 20:32:58,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:32:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:32:58,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:32:58,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 11 [2019-11-28 20:32:58,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960425308] [2019-11-28 20:32:58,337 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-11-28 20:32:58,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:32:58,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:32:58,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:32:58,411 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 11 Second operand 11 states. [2019-11-28 20:32:58,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:32:58,868 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-11-28 20:32:58,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:32:58,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 60 transitions. [2019-11-28 20:32:58,870 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 20:32:58,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 48 transitions. [2019-11-28 20:32:58,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-28 20:32:58,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-28 20:32:58,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 48 transitions. [2019-11-28 20:32:58,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:32:58,872 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-11-28 20:32:58,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 48 transitions. [2019-11-28 20:32:58,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-11-28 20:32:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:32:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-11-28 20:32:58,876 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-11-28 20:32:58,876 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-11-28 20:32:58,876 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:32:58,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2019-11-28 20:32:58,877 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 20:32:58,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:32:58,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:32:58,878 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:32:58,878 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:32:58,878 INFO L794 eck$LassoCheckResult]: Stem: 1040#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1039#L-1 havoc main_#res;havoc main_#t~nondet21; 1022#L578 assume !(0 != main_#t~nondet21);havoc main_#t~nondet21;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1019#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 1020#L562-5 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1021#L562-3 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 1047#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1044#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1045#L566-7 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 1036#L567-3 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1026#L568-1 [2019-11-28 20:32:58,879 INFO L796 eck$LassoCheckResult]: Loop: 1026#L568-1 call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4);call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4);havoc f_#t~mem15;havoc f_#t~mem16;call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~nondet17;call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem18; 1027#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1042#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1051#L566-7 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 1050#L567-3 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1026#L568-1 [2019-11-28 20:32:58,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:32:58,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1434718863, now seen corresponding path program 1 times [2019-11-28 20:32:58,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:32:58,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95276309] [2019-11-28 20:32:58,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:32:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:58,907 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:32:58,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:32:58,907 INFO L82 PathProgramCache]: Analyzing trace with hash 114981600, now seen corresponding path program 1 times [2019-11-28 20:32:58,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:32:58,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106554152] [2019-11-28 20:32:58,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:32:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:32:58,919 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:32:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:32:58,920 INFO L82 PathProgramCache]: Analyzing trace with hash -588680336, now seen corresponding path program 1 times [2019-11-28 20:32:58,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:32:58,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857464565] [2019-11-28 20:32:58,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:32:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:32:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:32:59,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857464565] [2019-11-28 20:32:59,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006396780] [2019-11-28 20:32:59,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:32:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:32:59,240 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-28 20:32:59,242 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:32:59,316 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:32:59,317 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 70 [2019-11-28 20:32:59,318 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:32:59,384 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:32:59,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:32:59,407 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:32:59,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 251 treesize of output 52 [2019-11-28 20:32:59,408 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:32:59,494 INFO L614 ElimStorePlain]: treesize reduction 20, result has 80.0 percent of original size [2019-11-28 20:32:59,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:32:59,497 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:32:59,497 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:306, output treesize:77 [2019-11-28 20:32:59,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:32:59,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:32:59,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:32:59,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:32:59,825 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 20:32:59,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 43 [2019-11-28 20:32:59,862 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:32:59,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:32:59,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:32:59,914 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:32:59,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 149 treesize of output 121 [2019-11-28 20:32:59,916 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:00,114 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-11-28 20:33:00,115 INFO L614 ElimStorePlain]: treesize reduction 110, result has 50.9 percent of original size [2019-11-28 20:33:00,117 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-11-28 20:33:00,118 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:446, output treesize:72 [2019-11-28 20:33:00,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:00,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:33:00,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:33:00,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 11 [2019-11-28 20:33:00,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434515135] [2019-11-28 20:33:00,372 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-11-28 20:33:00,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:33:00,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:33:00,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:33:00,446 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. cyclomatic complexity: 10 Second operand 11 states. [2019-11-28 20:33:01,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:33:01,165 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-28 20:33:01,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:33:01,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 63 transitions. [2019-11-28 20:33:01,167 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 20:33:01,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 46 states and 51 transitions. [2019-11-28 20:33:01,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-28 20:33:01,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-28 20:33:01,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 51 transitions. [2019-11-28 20:33:01,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:33:01,168 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2019-11-28 20:33:01,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 51 transitions. [2019-11-28 20:33:01,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-11-28 20:33:01,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 20:33:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-11-28 20:33:01,172 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-11-28 20:33:01,172 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-11-28 20:33:01,172 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:33:01,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 48 transitions. [2019-11-28 20:33:01,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 20:33:01,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:01,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:01,173 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:33:01,174 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:33:01,174 INFO L794 eck$LassoCheckResult]: Stem: 1209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1208#L-1 havoc main_#res;havoc main_#t~nondet21; 1191#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1184#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 1185#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1213#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 1214#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1220#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1206#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 1207#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 1201#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1199#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1200#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 1193#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 1194#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1222#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1221#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 1192#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1186#L568 [2019-11-28 20:33:01,174 INFO L796 eck$LassoCheckResult]: Loop: 1186#L568 call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4);call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4);havoc f_#t~mem15;havoc f_#t~mem16;call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~nondet17;call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem18; 1187#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1197#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1198#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 1205#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1186#L568 [2019-11-28 20:33:01,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:01,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1529889349, now seen corresponding path program 1 times [2019-11-28 20:33:01,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:01,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196611349] [2019-11-28 20:33:01,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:33:01,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196611349] [2019-11-28 20:33:01,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322795868] [2019-11-28 20:33:01,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:33:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:01,409 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-28 20:33:01,411 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:01,488 INFO L343 Elim1Store]: treesize reduction 184, result has 13.6 percent of original size [2019-11-28 20:33:01,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 251 treesize of output 36 [2019-11-28 20:33:01,489 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:01,506 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:33:01,507 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-28 20:33:01,507 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:258, output treesize:42 [2019-11-28 20:33:01,553 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:33:01,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 53 [2019-11-28 20:33:01,556 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:01,580 INFO L614 ElimStorePlain]: treesize reduction 30, result has 52.4 percent of original size [2019-11-28 20:33:01,580 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:33:01,581 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:33 [2019-11-28 20:33:01,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:33:01,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:33:01,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-11-28 20:33:01,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076989321] [2019-11-28 20:33:01,647 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:33:01,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:01,647 INFO L82 PathProgramCache]: Analyzing trace with hash 69174960, now seen corresponding path program 2 times [2019-11-28 20:33:01,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:01,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694522019] [2019-11-28 20:33:01,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:01,660 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:01,854 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-11-28 20:33:01,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:33:01,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:33:01,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:33:01,925 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. cyclomatic complexity: 9 Second operand 11 states. [2019-11-28 20:33:02,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:33:02,075 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2019-11-28 20:33:02,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:33:02,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 22 transitions. [2019-11-28 20:33:02,076 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:33:02,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2019-11-28 20:33:02,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:33:02,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:33:02,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:33:02,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:33:02,078 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:33:02,078 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:33:02,078 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:33:02,078 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:33:02,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:33:02,078 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:33:02,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:33:02,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:33:02 BoogieIcfgContainer [2019-11-28 20:33:02,085 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:33:02,086 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:33:02,086 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:33:02,086 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:33:02,087 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:32:44" (3/4) ... [2019-11-28 20:33:02,091 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:33:02,091 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:33:02,092 INFO L168 Benchmark]: Toolchain (without parser) took 18586.02 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 382.7 MB). Free memory was 957.7 MB in the beginning and 849.5 MB in the end (delta: 108.2 MB). Peak memory consumption was 490.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:02,093 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:33:02,093 INFO L168 Benchmark]: CACSL2BoogieTranslator took 572.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:02,094 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.24 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. [2019-11-28 20:33:02,094 INFO L168 Benchmark]: Boogie Preprocessor took 34.78 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. [2019-11-28 20:33:02,095 INFO L168 Benchmark]: RCFGBuilder took 600.83 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.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:02,095 INFO L168 Benchmark]: BuchiAutomizer took 17303.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 241.2 MB). Free memory was 1.1 GB in the beginning and 849.5 MB in the end (delta: 230.9 MB). Peak memory consumption was 472.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:02,096 INFO L168 Benchmark]: Witness Printer took 4.95 ms. Allocated memory is still 1.4 GB. Free memory is still 849.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:33:02,099 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 572.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.24 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 34.78 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 600.83 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.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17303.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 241.2 MB). Free memory was 1.1 GB in the beginning and 849.5 MB in the end (delta: 230.9 MB). Peak memory consumption was 472.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.95 ms. Allocated memory is still 1.4 GB. Free memory is still 849.5 MB. 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 - 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 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.2s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 13.9s. Construction of modules took 0.8s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 114 SDtfs, 137 SDslu, 225 SDs, 0 SdLazy, 364 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital543 mio100 ax103 hnf100 lsp93 ukn44 mio100 lsp33 div100 bol100 ite100 ukn100 eq199 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms 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...