./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11_true-termination.c.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 2e31c843d33c80f978b3ed5615692b93565f0ae0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:48:20,083 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:48:20,085 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:48:20,098 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:48:20,098 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:48:20,100 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:48:20,101 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:48:20,104 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:48:20,106 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:48:20,107 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:48:20,108 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:48:20,109 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:48:20,110 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:48:20,111 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:48:20,113 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:48:20,114 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:48:20,115 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:48:20,117 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:48:20,120 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:48:20,122 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:48:20,123 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:48:20,125 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:48:20,132 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:48:20,134 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:48:20,134 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:48:20,136 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:48:20,139 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:48:20,141 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:48:20,142 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:48:20,144 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:48:20,144 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:48:20,145 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:48:20,145 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:48:20,146 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:48:20,149 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:48:20,153 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:48:20,155 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:48:20,181 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:48:20,182 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:48:20,184 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:48:20,184 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:48:20,184 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:48:20,184 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:48:20,185 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:48:20,185 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:48:20,185 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:48:20,186 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:48:20,186 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:48:20,186 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:48:20,187 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:48:20,187 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:48:20,187 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:48:20,188 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:48:20,188 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:48:20,188 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:48:20,189 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:48:20,189 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:48:20,189 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:48:20,189 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:48:20,189 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:48:20,190 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:48:20,190 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:48:20,190 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:48:20,190 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:48:20,190 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:48:20,193 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:48:20,194 INFO L133 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 -> 2e31c843d33c80f978b3ed5615692b93565f0ae0 [2019-01-14 02:48:20,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:48:20,282 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:48:20,289 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:48:20,292 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:48:20,292 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:48:20,293 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11_true-termination.c.i [2019-01-14 02:48:20,357 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afeab0ccc/ed71be6be7b149199ec2207ac8e51171/FLAGeab37f825 [2019-01-14 02:48:20,916 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:48:20,917 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11_true-termination.c.i [2019-01-14 02:48:20,923 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afeab0ccc/ed71be6be7b149199ec2207ac8e51171/FLAGeab37f825 [2019-01-14 02:48:21,220 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afeab0ccc/ed71be6be7b149199ec2207ac8e51171 [2019-01-14 02:48:21,224 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:48:21,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:48:21,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:48:21,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:48:21,230 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:48:21,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:48:21" (1/1) ... [2019-01-14 02:48:21,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e6161e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:21, skipping insertion in model container [2019-01-14 02:48:21,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:48:21" (1/1) ... [2019-01-14 02:48:21,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:48:21,262 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:48:21,477 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:48:21,488 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:48:21,504 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:48:21,521 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:48:21,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:21 WrapperNode [2019-01-14 02:48:21,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:48:21,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:48:21,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:48:21,523 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:48:21,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:21" (1/1) ... [2019-01-14 02:48:21,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:21" (1/1) ... [2019-01-14 02:48:21,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:48:21,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:48:21,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:48:21,568 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:48:21,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:21" (1/1) ... [2019-01-14 02:48:21,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:21" (1/1) ... [2019-01-14 02:48:21,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:21" (1/1) ... [2019-01-14 02:48:21,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:21" (1/1) ... [2019-01-14 02:48:21,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:21" (1/1) ... [2019-01-14 02:48:21,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:21" (1/1) ... [2019-01-14 02:48:21,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:21" (1/1) ... [2019-01-14 02:48:21,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:48:21,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:48:21,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:48:21,598 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:48:21,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:21" (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-01-14 02:48:21,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:48:21,723 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-01-14 02:48:21,723 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-01-14 02:48:21,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 02:48:21,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:48:21,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:48:21,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:48:21,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:48:22,089 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:48:22,089 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:48:22,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:48:22 BoogieIcfgContainer [2019-01-14 02:48:22,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:48:22,091 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:48:22,091 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:48:22,094 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:48:22,095 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:48:22,096 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:48:21" (1/3) ... [2019-01-14 02:48:22,097 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6811e027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:48:22, skipping insertion in model container [2019-01-14 02:48:22,097 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:48:22,097 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:21" (2/3) ... [2019-01-14 02:48:22,097 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6811e027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:48:22, skipping insertion in model container [2019-01-14 02:48:22,098 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:48:22,098 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:48:22" (3/3) ... [2019-01-14 02:48:22,099 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11_true-termination.c.i [2019-01-14 02:48:22,178 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:48:22,179 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:48:22,179 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:48:22,179 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:48:22,179 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:48:22,179 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:48:22,180 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:48:22,180 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:48:22,180 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:48:22,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 02:48:22,221 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 02:48:22,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:22,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:22,231 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:48:22,231 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:22,231 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:48:22,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 02:48:22,234 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 02:48:22,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:22,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:22,235 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:48:22,236 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:22,244 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 19#L28-3true [2019-01-14 02:48:22,245 INFO L796 eck$LassoCheckResult]: Loop: 19#L28-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 4#L28-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 9#L32true assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 20#L36true call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 3#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 6#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 14#recFINALtrue assume true; 12#recEXITtrue >#44#return; 18#L36-1true assume -1 == main_#t~ret12;main_#t~ite13 := -1; 11#L36-3true call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite13;havoc main_#t~mem14;havoc main_#t~ret12; 19#L28-3true [2019-01-14 02:48:22,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:22,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-01-14 02:48:22,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:22,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:22,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:22,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:22,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:22,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:22,370 INFO L82 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2019-01-14 02:48:22,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:22,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:22,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:22,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:22,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:22,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:48:22,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 02:48:22,696 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:48:22,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:48:22,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:48:22,714 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2019-01-14 02:48:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:48:23,093 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-01-14 02:48:23,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:48:23,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-01-14 02:48:23,099 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 02:48:23,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2019-01-14 02:48:23,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 02:48:23,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-14 02:48:23,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-01-14 02:48:23,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:48:23,111 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-14 02:48:23,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-01-14 02:48:23,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-14 02:48:23,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 02:48:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-01-14 02:48:23,142 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-14 02:48:23,142 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-14 02:48:23,142 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:48:23,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-01-14 02:48:23,144 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 02:48:23,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:23,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:23,145 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:48:23,145 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:23,145 INFO L794 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 57#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 58#L28-3 [2019-01-14 02:48:23,146 INFO L796 eck$LassoCheckResult]: Loop: 58#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 55#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 56#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 52#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 51#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 54#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 53#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 51#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 54#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 59#recFINAL assume true; 64#recEXIT >#42#return; 61#L19-1 #res := #t~ret5;havoc #t~ret5; 62#recFINAL assume true; 66#recEXIT >#44#return; 65#L36-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 63#L36-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite13;havoc main_#t~mem14;havoc main_#t~ret12; 58#L28-3 [2019-01-14 02:48:23,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:23,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2019-01-14 02:48:23,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:23,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:23,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:23,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:23,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:23,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:23,172 INFO L82 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2019-01-14 02:48:23,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:23,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:23,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:23,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:23,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:23,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:23,295 INFO L82 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2019-01-14 02:48:23,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:23,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:23,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:23,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:23,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:23,734 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-14 02:48:23,880 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-14 02:48:24,579 WARN L181 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-01-14 02:48:24,694 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-14 02:48:24,900 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-01-14 02:48:25,028 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-14 02:48:25,768 WARN L181 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 123 [2019-01-14 02:48:25,917 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-14 02:48:26,049 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:48:26,051 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:48:26,051 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:48:26,051 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:48:26,051 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:48:26,051 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:48:26,052 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:48:26,052 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:48:26,052 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:48:26,052 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:48:26,052 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:48:26,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,654 WARN L181 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-01-14 02:48:26,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:27,105 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-01-14 02:48:27,184 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:48:27,189 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:48:27,191 INFO L122 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-01-14 02:48:27,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,200 INFO L122 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-01-14 02:48:27,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,203 INFO L122 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-01-14 02:48:27,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,205 INFO L122 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-01-14 02:48:27,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:27,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:27,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,213 INFO L122 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-01-14 02:48:27,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,216 INFO L122 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-01-14 02:48:27,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:27,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:27,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,238 INFO L122 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-01-14 02:48:27,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,240 INFO L122 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-01-14 02:48:27,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,244 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:27,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:27,260 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:48:27,270 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:48:27,270 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:48:27,272 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:48:27,274 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:48:27,274 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:48:27,275 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2019-01-14 02:48:27,295 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:48:27,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:48:27,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:27,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:27,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:27,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:27,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:27,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 02:48:27,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:27,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2019-01-14 02:48:27,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:48:27,547 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:27,563 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:48:27,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:48:27,571 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:36, output treesize:15 [2019-01-14 02:48:27,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-14 02:48:27,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-01-14 02:48:27,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:27,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:48:27,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:48:27,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2019-01-14 02:48:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 02:48:27,730 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-01-14 02:48:27,731 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-01-14 02:48:27,904 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 62 states and 73 transitions. Complement of second has 17 states. [2019-01-14 02:48:27,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-01-14 02:48:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:48:27,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2019-01-14 02:48:27,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2019-01-14 02:48:27,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:27,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2019-01-14 02:48:27,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:27,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2019-01-14 02:48:27,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:27,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. [2019-01-14 02:48:27,918 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-01-14 02:48:27,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2019-01-14 02:48:27,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-01-14 02:48:27,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-14 02:48:27,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2019-01-14 02:48:27,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:48:27,922 INFO L706 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-01-14 02:48:27,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2019-01-14 02:48:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2019-01-14 02:48:27,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-14 02:48:27,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2019-01-14 02:48:27,930 INFO L729 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-01-14 02:48:27,930 INFO L609 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-01-14 02:48:27,930 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:48:27,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2019-01-14 02:48:27,932 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-01-14 02:48:27,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:27,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:27,933 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:27,933 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:48:27,933 INFO L794 eck$LassoCheckResult]: Stem: 255#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 249#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 250#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 245#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 246#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 256#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 274#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 285#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 240#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2019-01-14 02:48:27,934 INFO L796 eck$LassoCheckResult]: Loop: 238#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 241#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 239#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2019-01-14 02:48:27,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:27,934 INFO L82 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2019-01-14 02:48:27,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:27,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:27,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:27,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:27,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:27,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:27,984 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2019-01-14 02:48:27,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:27,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:27,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:27,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:27,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:28,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:28,022 INFO L82 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2019-01-14 02:48:28,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:28,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:28,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:28,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:28,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:28,368 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-01-14 02:48:28,722 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-01-14 02:48:29,157 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-01-14 02:48:29,264 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-01-14 02:48:29,433 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-14 02:48:29,795 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 107 [2019-01-14 02:48:30,016 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-01-14 02:48:30,020 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:48:30,020 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:48:30,020 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:48:30,021 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:48:30,021 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:48:30,021 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:48:30,021 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:48:30,022 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:48:30,022 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:48:30,022 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:48:30,022 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:48:30,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,276 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-01-14 02:48:30,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:30,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:32,384 WARN L181 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-01-14 02:48:32,501 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:48:32,501 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:48:32,501 INFO L122 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-01-14 02:48:32,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:32,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:32,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:32,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:32,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:32,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:32,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:32,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:32,507 INFO L122 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-01-14 02:48:32,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:32,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:32,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:32,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:32,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:32,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:32,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:32,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:32,512 INFO L122 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-01-14 02:48:32,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:32,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:32,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:32,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:32,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:32,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:32,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:32,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:32,515 INFO L122 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-01-14 02:48:32,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:32,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:32,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:32,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:32,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:32,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:32,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:32,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:32,517 INFO L122 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-01-14 02:48:32,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:32,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:32,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:32,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:32,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:32,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:32,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:32,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:32,519 INFO L122 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-01-14 02:48:32,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:32,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:32,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:32,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:32,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:32,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:32,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:32,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:32,528 INFO L122 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-01-14 02:48:32,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:32,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:32,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:32,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:32,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:32,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:32,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:32,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:32,537 INFO L122 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-01-14 02:48:32,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:32,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:32,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:32,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:32,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:32,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:32,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:32,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:32,540 INFO L122 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-01-14 02:48:32,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:32,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:32,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:32,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:32,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:32,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:32,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:32,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:32,547 INFO L122 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-01-14 02:48:32,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:32,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:32,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:32,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:32,553 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:32,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:32,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:32,562 INFO L122 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-01-14 02:48:32,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:32,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:32,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:32,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:32,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:32,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:32,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:32,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:32,569 INFO L122 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-01-14 02:48:32,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:32,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:32,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:32,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:32,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:32,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:32,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:32,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:32,576 INFO L122 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-01-14 02:48:32,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:32,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:32,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:32,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:32,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:32,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:32,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:32,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:32,578 INFO L122 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-01-14 02:48:32,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:32,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:32,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:32,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:32,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:32,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:32,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:32,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:32,591 INFO L122 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-01-14 02:48:32,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:32,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:32,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:32,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:32,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:32,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:32,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:32,619 INFO L122 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-01-14 02:48:32,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:32,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:32,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:32,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:32,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:32,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:32,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:32,628 INFO L122 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-01-14 02:48:32,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:32,628 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:48:32,628 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:48:32,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:32,644 INFO L402 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2019-01-14 02:48:32,644 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:48:32,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:32,710 INFO L122 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-01-14 02:48:32,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:32,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:32,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:32,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:32,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:32,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:32,741 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:48:32,761 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:48:32,761 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:48:32,762 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:48:32,762 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:48:32,769 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:48:32,769 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2019-01-14 02:48:32,818 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-01-14 02:48:32,821 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:48:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:32,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:32,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:33,017 INFO L478 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 3 case distinctions, treesize of input 36 treesize of output 44 [2019-01-14 02:48:33,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-14 02:48:33,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:33,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:33,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2019-01-14 02:48:33,089 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 02:48:33,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:48:33,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:48:33,133 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2019-01-14 02:48:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:33,182 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:48:33,182 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-14 02:48:33,316 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 99 states and 122 transitions. Complement of second has 17 states. [2019-01-14 02:48:33,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:48:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:48:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-01-14 02:48:33,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 02:48:33,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:33,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-14 02:48:33,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:33,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-14 02:48:33,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:33,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2019-01-14 02:48:33,328 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-01-14 02:48:33,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2019-01-14 02:48:33,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-01-14 02:48:33,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2019-01-14 02:48:33,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2019-01-14 02:48:33,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:48:33,333 INFO L706 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2019-01-14 02:48:33,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2019-01-14 02:48:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-01-14 02:48:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-14 02:48:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2019-01-14 02:48:33,345 INFO L729 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-01-14 02:48:33,345 INFO L609 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-01-14 02:48:33,345 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:48:33,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2019-01-14 02:48:33,349 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-01-14 02:48:33,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:33,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:33,350 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:33,350 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:33,350 INFO L794 eck$LassoCheckResult]: Stem: 492#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 484#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 485#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 510#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 546#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 521#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 544#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 543#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 471#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 470#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 473#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 482#recFINAL assume true; 505#recEXIT >#42#return; 530#L19-1 #res := #t~ret5;havoc #t~ret5; 529#recFINAL assume true; 520#recEXIT >#44#return; 508#L36-1 assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 499#L36-3 [2019-01-14 02:48:33,351 INFO L796 eck$LassoCheckResult]: Loop: 499#L36-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite13;havoc main_#t~mem14;havoc main_#t~ret12; 500#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 531#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 526#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 512#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 513#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 536#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 524#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 513#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 536#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 537#recFINAL assume true; 535#recEXIT >#42#return; 525#L19-1 #res := #t~ret5;havoc #t~ret5; 533#recFINAL assume true; 523#recEXIT >#44#return; 519#L36-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 499#L36-3 [2019-01-14 02:48:33,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:33,351 INFO L82 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2019-01-14 02:48:33,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:33,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:33,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:33,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:33,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:33,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:33,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:48:33,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:48:33,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:33,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:33,718 INFO L478 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 3 case distinctions, treesize of input 25 treesize of output 35 [2019-01-14 02:48:33,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-14 02:48:33,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:33,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:34,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2019-01-14 02:48:34,006 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 02:48:34,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:48:34,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:48:34,050 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:31 [2019-01-14 02:48:34,160 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 02:48:34,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:34,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-14 02:48:34,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-01-14 02:48:34,169 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:34,171 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:48:34,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:48:34,173 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:5 [2019-01-14 02:48:34,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:34,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:48:34,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-01-14 02:48:34,215 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:48:34,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:34,215 INFO L82 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2019-01-14 02:48:34,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:34,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:34,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:34,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:34,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:34,498 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 02:48:34,728 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 02:48:34,946 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-14 02:48:35,262 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2019-01-14 02:48:35,555 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-01-14 02:48:36,120 WARN L181 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 129 [2019-01-14 02:48:36,288 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-01-14 02:48:36,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 02:48:36,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-01-14 02:48:36,289 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand 13 states. [2019-01-14 02:48:36,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:48:36,420 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-01-14 02:48:36,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 02:48:36,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 110 transitions. [2019-01-14 02:48:36,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:48:36,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 67 transitions. [2019-01-14 02:48:36,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 02:48:36,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 02:48:36,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. [2019-01-14 02:48:36,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:48:36,443 INFO L706 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2019-01-14 02:48:36,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. [2019-01-14 02:48:36,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-01-14 02:48:36,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 02:48:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-01-14 02:48:36,455 INFO L729 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-01-14 02:48:36,455 INFO L609 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-01-14 02:48:36,456 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:48:36,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2019-01-14 02:48:36,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:48:36,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:36,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:36,462 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:36,462 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:48:36,463 INFO L794 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 720#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 721#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 735#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 725#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 711#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 710#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 712#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 718#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 741#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 717#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 719#recFINAL assume true; 740#recEXIT >#42#return; 739#L19-1 #res := #t~ret5;havoc #t~ret5; 738#recFINAL assume true; 736#recEXIT >#44#return; 734#L36-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 730#L36-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite13;havoc main_#t~mem14;havoc main_#t~ret12; 731#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 713#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 714#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 709#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 706#recENTRY [2019-01-14 02:48:36,463 INFO L796 eck$LassoCheckResult]: Loop: 706#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 708#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 707#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 706#recENTRY [2019-01-14 02:48:36,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:36,463 INFO L82 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2019-01-14 02:48:36,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:36,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:36,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:36,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:36,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:36,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:36,530 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2019-01-14 02:48:36,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:36,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:36,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:36,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:36,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:36,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:36,544 INFO L82 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2019-01-14 02:48:36,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:36,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:36,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:36,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:36,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:37,210 WARN L181 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-01-14 02:48:37,762 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2019-01-14 02:48:37,920 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-01-14 02:48:39,504 WARN L181 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 230 DAG size of output: 191 [2019-01-14 02:48:40,051 WARN L181 SmtUtils]: Spent 536.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-01-14 02:48:40,439 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-01-14 02:48:40,726 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-14 02:48:40,730 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:48:40,730 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:48:40,730 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:48:40,730 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:48:40,730 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:48:40,730 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:48:40,730 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:48:40,731 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:48:40,731 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11_true-termination.c.i_Iteration5_Lasso [2019-01-14 02:48:40,731 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:48:40,731 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:48:40,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:41,040 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-01-14 02:48:41,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:41,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:41,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:41,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:41,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:41,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:41,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:41,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:41,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:41,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:41,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:41,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:41,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:41,985 WARN L181 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:48:42,063 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:48:42,064 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:48:42,064 INFO L122 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-01-14 02:48:42,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:42,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:42,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:42,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,069 INFO L122 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-01-14 02:48:42,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:42,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:42,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:42,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,074 INFO L122 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-01-14 02:48:42,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:42,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:42,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:42,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,076 INFO L122 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-01-14 02:48:42,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:42,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:42,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:42,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,086 INFO L122 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-01-14 02:48:42,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:42,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:42,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,090 INFO L122 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-01-14 02:48:42,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:42,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:42,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:42,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,092 INFO L122 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-01-14 02:48:42,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:42,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:42,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:42,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,094 INFO L122 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-01-14 02:48:42,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:42,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:42,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,096 INFO L122 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-01-14 02:48:42,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:42,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:42,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:42,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,098 INFO L122 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-01-14 02:48:42,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:42,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:42,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:42,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,100 INFO L122 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-01-14 02:48:42,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:42,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:42,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:42,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,102 INFO L122 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-01-14 02:48:42,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:42,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:42,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:42,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,104 INFO L122 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-01-14 02:48:42,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:42,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:42,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:42,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,106 INFO L122 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-01-14 02:48:42,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:42,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:42,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:42,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,107 INFO L122 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-01-14 02:48:42,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:42,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:42,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:42,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,109 INFO L122 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-01-14 02:48:42,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:42,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:42,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:42,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,111 INFO L122 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-01-14 02:48:42,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:42,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:42,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:42,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,113 INFO L122 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-01-14 02:48:42,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:42,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:42,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:42,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,115 INFO L122 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-01-14 02:48:42,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:42,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:42,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:42,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,117 INFO L122 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-01-14 02:48:42,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:42,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:42,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:42,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,119 INFO L122 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-01-14 02:48:42,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:42,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:42,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,125 INFO L122 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-01-14 02:48:42,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:42,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:42,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,130 INFO L122 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-01-14 02:48:42,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:42,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:42,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,132 INFO L122 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-01-14 02:48:42,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:42,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:42,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,135 INFO L122 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-01-14 02:48:42,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:42,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:42,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,149 INFO L122 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-01-14 02:48:42,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,150 INFO L205 nArgumentSynthesizer]: 16 stem disjuncts [2019-01-14 02:48:42,150 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:48:42,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,169 INFO L402 nArgumentSynthesizer]: We have 76 Motzkin's Theorem applications. [2019-01-14 02:48:42,169 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:48:42,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,252 INFO L122 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-01-14 02:48:42,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:42,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:42,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:42,262 INFO L122 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-01-14 02:48:42,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:42,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:42,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:42,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:42,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:42,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:42,283 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:48:42,295 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:48:42,295 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:48:42,295 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:48:42,296 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:48:42,297 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:48:42,297 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2019-01-14 02:48:42,354 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-01-14 02:48:42,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:48:42,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:42,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:42,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:42,828 INFO L478 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 3 case distinctions, treesize of input 36 treesize of output 44 [2019-01-14 02:48:42,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-14 02:48:42,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:42,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:42,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2019-01-14 02:48:42,985 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 02:48:43,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:48:43,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:48:43,036 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2019-01-14 02:48:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:43,063 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-01-14 02:48:43,063 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-14 02:48:43,140 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2019-01-14 02:48:43,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:48:43,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:48:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-14 02:48:43,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2019-01-14 02:48:43,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:43,143 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:48:43,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:43,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:43,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:43,350 INFO L478 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 3 case distinctions, treesize of input 36 treesize of output 44 [2019-01-14 02:48:43,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-14 02:48:43,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:43,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:43,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2019-01-14 02:48:43,404 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 02:48:43,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:48:43,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:48:43,453 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2019-01-14 02:48:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:43,476 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:48:43,477 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-14 02:48:43,554 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2019-01-14 02:48:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:48:43,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:48:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-14 02:48:43,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2019-01-14 02:48:43,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:43,560 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:48:43,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:43,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:43,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:43,708 INFO L478 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 3 case distinctions, treesize of input 36 treesize of output 44 [2019-01-14 02:48:43,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-14 02:48:43,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:43,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:43,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2019-01-14 02:48:43,771 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 02:48:43,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:48:43,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:48:43,816 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2019-01-14 02:48:43,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:43,841 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:48:43,841 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-14 02:48:43,933 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 68 states and 78 transitions. Complement of second has 15 states. [2019-01-14 02:48:43,934 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-01-14 02:48:43,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:48:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2019-01-14 02:48:43,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2019-01-14 02:48:43,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:43,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2019-01-14 02:48:43,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:43,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2019-01-14 02:48:43,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:43,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2019-01-14 02:48:43,943 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:48:43,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2019-01-14 02:48:43,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:48:43,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:48:43,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:48:43,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:48:43,944 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:43,944 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:43,944 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:43,944 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:48:43,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:48:43,944 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:48:43,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:48:43,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:48:43 BoogieIcfgContainer [2019-01-14 02:48:43,955 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:48:43,955 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:48:43,955 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:48:43,956 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:48:43,956 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:48:22" (3/4) ... [2019-01-14 02:48:43,960 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:48:43,960 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:48:43,961 INFO L168 Benchmark]: Toolchain (without parser) took 22736.68 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 345.0 MB). Free memory was 947.3 MB in the beginning and 968.8 MB in the end (delta: -21.5 MB). Peak memory consumption was 323.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:43,962 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:43,962 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.70 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:43,963 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.54 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:43,963 INFO L168 Benchmark]: Boogie Preprocessor took 29.97 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:43,964 INFO L168 Benchmark]: RCFGBuilder took 492.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:43,965 INFO L168 Benchmark]: BuchiAutomizer took 21864.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 207.1 MB). Free memory was 1.1 GB in the beginning and 968.8 MB in the end (delta: 145.1 MB). Peak memory consumption was 352.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:43,966 INFO L168 Benchmark]: Witness Printer took 4.69 ms. Allocated memory is still 1.4 GB. Free memory is still 968.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:43,970 INFO L336 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.70 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.54 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.97 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 492.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21864.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 207.1 MB). Free memory was 1.1 GB in the beginning and 968.8 MB in the end (delta: 145.1 MB). Peak memory consumption was 352.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.69 ms. Allocated memory is still 1.4 GB. Free memory is still 968.8 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 - 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 18.3s. Construction of modules took 0.6s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 82 SDtfs, 58 SDslu, 140 SDs, 0 SdLazy, 250 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital385 mio100 ax100 hnf100 lsp98 ukn41 mio100 lsp29 div100 bol100 ite100 ukn100 eq197 hnf88 smp100 dnf386 smp88 tf100 neg86 sie151 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 102ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 16 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 76 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...