./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4726e57f-0670-4d65-8f58-ef081f4115ed/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4726e57f-0670-4d65-8f58-ef081f4115ed/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4726e57f-0670-4d65-8f58-ef081f4115ed/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4726e57f-0670-4d65-8f58-ef081f4115ed/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4726e57f-0670-4d65-8f58-ef081f4115ed/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4726e57f-0670-4d65-8f58-ef081f4115ed/bin-2019/uautomizer --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 f7c8cd0f6441598a9b17eacee015376606f871a4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:11:35,542 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:11:35,543 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:11:35,550 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:11:35,550 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:11:35,551 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:11:35,552 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:11:35,553 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:11:35,554 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:11:35,554 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:11:35,555 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:11:35,555 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:11:35,556 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:11:35,557 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:11:35,557 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:11:35,558 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:11:35,558 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:11:35,560 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:11:35,561 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:11:35,562 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:11:35,563 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:11:35,564 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:11:35,565 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:11:35,565 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:11:35,566 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:11:35,566 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:11:35,567 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:11:35,568 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:11:35,568 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:11:35,569 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:11:35,569 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:11:35,570 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:11:35,570 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:11:35,570 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:11:35,571 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:11:35,571 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:11:35,571 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4726e57f-0670-4d65-8f58-ef081f4115ed/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-22 22:11:35,582 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:11:35,582 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:11:35,583 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:11:35,583 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:11:35,584 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:11:35,584 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 22:11:35,584 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 22:11:35,584 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 22:11:35,584 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 22:11:35,584 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 22:11:35,584 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 22:11:35,584 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:11:35,585 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:11:35,585 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:11:35,585 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:11:35,585 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 22:11:35,585 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 22:11:35,585 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 22:11:35,585 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:11:35,585 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 22:11:35,586 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:11:35,586 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 22:11:35,586 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:11:35,586 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:11:35,586 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 22:11:35,586 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:11:35,586 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:11:35,586 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 22:11:35,587 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 22:11:35,587 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_4726e57f-0670-4d65-8f58-ef081f4115ed/bin-2019/uautomizer 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 -> f7c8cd0f6441598a9b17eacee015376606f871a4 [2018-11-22 22:11:35,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:11:35,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:11:35,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:11:35,619 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:11:35,619 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:11:35,619 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4726e57f-0670-4d65-8f58-ef081f4115ed/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5_true-termination.c.i [2018-11-22 22:11:35,654 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4726e57f-0670-4d65-8f58-ef081f4115ed/bin-2019/uautomizer/data/70f4ce9c8/46ca504712924135bddaed170e62b363/FLAGe82586f0f [2018-11-22 22:11:36,058 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:11:36,058 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4726e57f-0670-4d65-8f58-ef081f4115ed/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5_true-termination.c.i [2018-11-22 22:11:36,063 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4726e57f-0670-4d65-8f58-ef081f4115ed/bin-2019/uautomizer/data/70f4ce9c8/46ca504712924135bddaed170e62b363/FLAGe82586f0f [2018-11-22 22:11:36,076 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4726e57f-0670-4d65-8f58-ef081f4115ed/bin-2019/uautomizer/data/70f4ce9c8/46ca504712924135bddaed170e62b363 [2018-11-22 22:11:36,078 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:11:36,079 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:11:36,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:11:36,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:11:36,082 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:11:36,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:11:36" (1/1) ... [2018-11-22 22:11:36,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bfbb521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:36, skipping insertion in model container [2018-11-22 22:11:36,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:11:36" (1/1) ... [2018-11-22 22:11:36,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:11:36,104 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:11:36,210 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:11:36,217 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:11:36,228 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:11:36,239 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:11:36,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:36 WrapperNode [2018-11-22 22:11:36,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:11:36,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:11:36,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:11:36,240 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:11:36,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:36" (1/1) ... [2018-11-22 22:11:36,251 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:36" (1/1) ... [2018-11-22 22:11:36,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:11:36,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:11:36,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:11:36,262 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:11:36,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:36" (1/1) ... [2018-11-22 22:11:36,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:36" (1/1) ... [2018-11-22 22:11:36,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:36" (1/1) ... [2018-11-22 22:11:36,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:36" (1/1) ... [2018-11-22 22:11:36,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:36" (1/1) ... [2018-11-22 22:11:36,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:36" (1/1) ... [2018-11-22 22:11:36,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:36" (1/1) ... [2018-11-22 22:11:36,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:11:36,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:11:36,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:11:36,314 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:11:36,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4726e57f-0670-4d65-8f58-ef081f4115ed/bin-2019/uautomizer/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 [2018-11-22 22:11:36,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 22:11:36,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:11:36,347 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-22 22:11:36,347 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-22 22:11:36,347 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-22 22:11:36,347 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-22 22:11:36,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:11:36,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:11:36,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 22:11:36,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 22:11:36,488 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:11:36,488 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-22 22:11:36,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:11:36 BoogieIcfgContainer [2018-11-22 22:11:36,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:11:36,489 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 22:11:36,489 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 22:11:36,491 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 22:11:36,492 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:11:36,492 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 10:11:36" (1/3) ... [2018-11-22 22:11:36,493 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@648dbe17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:11:36, skipping insertion in model container [2018-11-22 22:11:36,493 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:11:36,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:36" (2/3) ... [2018-11-22 22:11:36,493 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@648dbe17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:11:36, skipping insertion in model container [2018-11-22 22:11:36,493 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:11:36,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:11:36" (3/3) ... [2018-11-22 22:11:36,495 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex5_true-termination.c.i [2018-11-22 22:11:36,525 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:11:36,526 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 22:11:36,526 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 22:11:36,526 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 22:11:36,526 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:11:36,526 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:11:36,527 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 22:11:36,527 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:11:36,527 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 22:11:36,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-22 22:11:36,557 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-22 22:11:36,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:11:36,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:11:36,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:11:36,563 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:11:36,563 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 22:11:36,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-22 22:11:36,564 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-22 22:11:36,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:11:36,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:11:36,565 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:11:36,565 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:11:36,572 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 13#L63true assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 8#L63-2true assume !main_#t~short17;havoc main_#t~mem16;havoc main_#t~mem15;havoc main_#t~short17;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 21#L66true call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 18#fENTRYtrue [2018-11-22 22:11:36,573 INFO L796 eck$LassoCheckResult]: Loop: 18#fENTRYtrue ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 11#L17true assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 19#L25true call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 15#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 3#L34true assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 4#gFINALtrue assume true; 7#gEXITtrue >#37#return; 22#L25-1true call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 18#fENTRYtrue [2018-11-22 22:11:36,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:36,578 INFO L82 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 1 times [2018-11-22 22:11:36,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:11:36,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:11:36,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:36,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:11:36,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:36,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:36,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1513071857, now seen corresponding path program 1 times [2018-11-22 22:11:36,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:11:36,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:11:36,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:36,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:11:36,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:11:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:11:36,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:11:36,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 22:11:36,815 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:11:36,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:11:36,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:11:36,826 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 6 states. [2018-11-22 22:11:36,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:11:36,928 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-22 22:11:36,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 22:11:36,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-11-22 22:11:36,933 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-22 22:11:36,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 17 states and 20 transitions. [2018-11-22 22:11:36,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-22 22:11:36,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-22 22:11:36,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2018-11-22 22:11:36,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:11:36,941 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-22 22:11:36,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2018-11-22 22:11:36,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-22 22:11:36,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-22 22:11:36,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-22 22:11:36,966 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-22 22:11:36,966 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-22 22:11:36,966 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 22:11:36,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-22 22:11:36,967 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-22 22:11:36,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:11:36,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:11:36,968 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:11:36,968 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:11:36,968 INFO L794 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 73#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 67#L63-2 assume !main_#t~short17;havoc main_#t~mem16;havoc main_#t~mem15;havoc main_#t~short17;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 68#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 75#fENTRY [2018-11-22 22:11:36,968 INFO L796 eck$LassoCheckResult]: Loop: 75#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 70#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 61#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 65#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 60#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 62#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 65#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 60#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 63#gFINAL assume true; 64#gEXIT >#41#return; 66#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 69#gFINAL assume true; 76#gEXIT >#37#return; 71#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 75#fENTRY [2018-11-22 22:11:36,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:36,968 INFO L82 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 2 times [2018-11-22 22:11:36,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:11:36,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:11:36,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:36,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:11:36,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:36,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:36,994 INFO L82 PathProgramCache]: Analyzing trace with hash 916774883, now seen corresponding path program 1 times [2018-11-22 22:11:36,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:11:36,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:11:36,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:36,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:11:36,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:11:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:11:37,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:11:37,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4726e57f-0670-4d65-8f58-ef081f4115ed/bin-2019/uautomizer/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 [2018-11-22 22:11:37,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:11:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:11:37,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:11:37,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-22 22:11:37,201 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 10 treesize of output 9 [2018-11-22 22:11:37,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:11:37,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:11:37,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:11:37,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-22 22:11:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:11:37,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:11:37,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-22 22:11:37,305 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:11:37,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 22:11:37,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:11:37,306 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 13 states. [2018-11-22 22:11:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:11:37,438 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-22 22:11:37,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 22:11:37,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-11-22 22:11:37,440 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-22 22:11:37,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2018-11-22 22:11:37,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-22 22:11:37,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-22 22:11:37,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-22 22:11:37,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:11:37,441 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-22 22:11:37,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-22 22:11:37,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-22 22:11:37,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-22 22:11:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-22 22:11:37,443 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-22 22:11:37,443 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-22 22:11:37,443 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 22:11:37,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-22 22:11:37,446 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-22 22:11:37,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:11:37,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:11:37,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:11:37,447 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-22 22:11:37,447 INFO L794 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 170#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 171#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 165#L63-2 assume !main_#t~short17;havoc main_#t~mem16;havoc main_#t~mem15;havoc main_#t~short17;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 166#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 173#fENTRY [2018-11-22 22:11:37,447 INFO L796 eck$LassoCheckResult]: Loop: 173#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 168#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 159#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 163#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 158#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 160#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 163#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 158#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 160#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 163#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 158#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 161#gFINAL assume true; 162#gEXIT >#41#return; 164#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 167#gFINAL assume true; 177#gEXIT >#41#return; 175#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 176#gFINAL assume true; 174#gEXIT >#37#return; 169#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 173#fENTRY [2018-11-22 22:11:37,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:37,447 INFO L82 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 3 times [2018-11-22 22:11:37,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:11:37,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:11:37,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:37,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:11:37,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:37,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:37,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1267451407, now seen corresponding path program 2 times [2018-11-22 22:11:37,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:11:37,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:11:37,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:37,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:11:37,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:37,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:37,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2054594769, now seen corresponding path program 1 times [2018-11-22 22:11:37,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:11:37,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:11:37,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:37,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:11:37,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:37,853 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2018-11-22 22:11:38,167 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 107 [2018-11-22 22:11:38,542 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 120 [2018-11-22 22:11:38,845 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2018-11-22 22:11:38,992 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:11:38,992 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:11:38,992 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:11:38,992 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:11:38,993 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:11:38,993 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:11:38,993 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:11:38,993 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:11:38,993 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5_true-termination.c.i_Iteration3_Lasso [2018-11-22 22:11:38,993 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:11:38,993 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:11:39,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:39,311 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:11:39,314 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:11:39,316 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 [2018-11-22 22:11:39,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:39,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:39,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:39,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,321 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 [2018-11-22 22:11:39,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:39,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:39,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:39,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,322 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 [2018-11-22 22:11:39,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:39,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:39,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:39,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,324 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 [2018-11-22 22:11:39,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:39,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:39,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:39,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,326 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 [2018-11-22 22:11:39,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:39,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:39,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:39,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,327 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 [2018-11-22 22:11:39,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:39,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:39,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:39,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,329 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 [2018-11-22 22:11:39,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:39,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:39,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:39,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,331 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 [2018-11-22 22:11:39,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:39,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:39,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:39,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,333 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 [2018-11-22 22:11:39,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:39,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:39,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:39,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,335 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 [2018-11-22 22:11:39,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:11:39,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:11:39,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,339 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 [2018-11-22 22:11:39,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:39,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:39,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:39,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,341 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 [2018-11-22 22:11:39,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:39,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:39,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:39,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,343 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 [2018-11-22 22:11:39,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:39,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:39,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:39,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,345 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 [2018-11-22 22:11:39,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:39,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:39,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:39,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,347 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 [2018-11-22 22:11:39,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:39,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:39,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:39,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,349 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 [2018-11-22 22:11:39,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:39,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:39,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:39,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,351 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 [2018-11-22 22:11:39,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:39,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,352 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:11:39,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,352 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 22:11:39,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:39,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,353 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 [2018-11-22 22:11:39,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:11:39,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:11:39,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,362 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 [2018-11-22 22:11:39,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:39,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,363 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:11:39,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,363 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 22:11:39,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:39,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,364 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 [2018-11-22 22:11:39,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:39,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,365 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:11:39,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,366 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 22:11:39,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:39,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,367 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 [2018-11-22 22:11:39,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:11:39,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:11:39,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,372 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 [2018-11-22 22:11:39,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:11:39,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:11:39,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:39,377 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 [2018-11-22 22:11:39,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:39,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:39,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:39,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:39,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:11:39,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:11:39,384 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:11:39,390 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:11:39,391 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-22 22:11:39,392 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:11:39,394 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:11:39,394 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:11:39,394 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(f_#in~v) = 2*f_#in~v + 1 Supporting invariants [] [2018-11-22 22:11:39,410 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-22 22:11:39,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:11:39,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:11:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:11:39,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:11:39,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-22 22:11:39,500 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-22 22:11:39,500 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-22 22:11:39,582 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 63 states and 72 transitions. Complement of second has 15 states. [2018-11-22 22:11:39,583 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 [2018-11-22 22:11:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 22:11:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-22 22:11:39,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 20 letters. [2018-11-22 22:11:39,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:11:39,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 25 letters. Loop has 20 letters. [2018-11-22 22:11:39,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:11:39,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 40 letters. [2018-11-22 22:11:39,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:11:39,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 72 transitions. [2018-11-22 22:11:39,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 22:11:39,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 40 states and 47 transitions. [2018-11-22 22:11:39,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-22 22:11:39,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-22 22:11:39,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2018-11-22 22:11:39,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:11:39,593 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-11-22 22:11:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2018-11-22 22:11:39,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2018-11-22 22:11:39,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-22 22:11:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-11-22 22:11:39,596 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-22 22:11:39,596 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-22 22:11:39,596 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 22:11:39,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2018-11-22 22:11:39,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 22:11:39,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:11:39,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:11:39,597 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:11:39,598 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:11:39,598 INFO L794 eck$LassoCheckResult]: Stem: 377#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 375#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 376#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 368#L63-2 assume !main_#t~short17;havoc main_#t~mem16;havoc main_#t~mem15;havoc main_#t~short17;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 369#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 378#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 371#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 359#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 365#gENTRY [2018-11-22 22:11:39,598 INFO L796 eck$LassoCheckResult]: Loop: 365#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 357#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 358#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 365#gENTRY [2018-11-22 22:11:39,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:39,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1845692449, now seen corresponding path program 1 times [2018-11-22 22:11:39,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:11:39,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:11:39,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:39,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:11:39,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:39,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:39,615 INFO L82 PathProgramCache]: Analyzing trace with hash 38883, now seen corresponding path program 1 times [2018-11-22 22:11:39,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:11:39,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:11:39,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:39,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:11:39,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:39,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:39,622 INFO L82 PathProgramCache]: Analyzing trace with hash -852415675, now seen corresponding path program 1 times [2018-11-22 22:11:39,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:11:39,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:11:39,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:39,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:11:39,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:39,974 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2018-11-22 22:11:40,227 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 100 [2018-11-22 22:11:40,277 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:11:40,278 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:11:40,278 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:11:40,278 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:11:40,278 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:11:40,278 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:11:40,278 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:11:40,278 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:11:40,278 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5_true-termination.c.i_Iteration4_Lasso [2018-11-22 22:11:40,278 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:11:40,278 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:11:40,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:40,643 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:11:40,643 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:11:40,644 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 [2018-11-22 22:11:40,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,646 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 [2018-11-22 22:11:40,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,654 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 [2018-11-22 22:11:40,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,656 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 [2018-11-22 22:11:40,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,658 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 [2018-11-22 22:11:40,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,659 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 [2018-11-22 22:11:40,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,661 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 [2018-11-22 22:11:40,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,662 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 [2018-11-22 22:11:40,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,664 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 [2018-11-22 22:11:40,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,666 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 [2018-11-22 22:11:40,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:11:40,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:11:40,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,668 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 [2018-11-22 22:11:40,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,670 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 [2018-11-22 22:11:40,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,672 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 [2018-11-22 22:11:40,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,673 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 [2018-11-22 22:11:40,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,675 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 [2018-11-22 22:11:40,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,676 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 [2018-11-22 22:11:40,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,678 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 [2018-11-22 22:11:40,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,679 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 [2018-11-22 22:11:40,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,681 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 [2018-11-22 22:11:40,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,682 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 [2018-11-22 22:11:40,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,684 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 [2018-11-22 22:11:40,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,685 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 [2018-11-22 22:11:40,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,686 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 [2018-11-22 22:11:40,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,688 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 [2018-11-22 22:11:40,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,690 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 [2018-11-22 22:11:40,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,691 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 [2018-11-22 22:11:40,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,693 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 [2018-11-22 22:11:40,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,694 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 [2018-11-22 22:11:40,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,696 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 [2018-11-22 22:11:40,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:11:40,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:11:40,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,698 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 [2018-11-22 22:11:40,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,700 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 [2018-11-22 22:11:40,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,702 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 [2018-11-22 22:11:40,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,703 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 [2018-11-22 22:11:40,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,705 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 [2018-11-22 22:11:40,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,706 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 [2018-11-22 22:11:40,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,708 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 [2018-11-22 22:11:40,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,709 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 [2018-11-22 22:11:40,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,711 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 [2018-11-22 22:11:40,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,713 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 [2018-11-22 22:11:40,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,714 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 [2018-11-22 22:11:40,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,716 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 [2018-11-22 22:11:40,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,718 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 [2018-11-22 22:11:40,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:40,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:40,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:40,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,719 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 [2018-11-22 22:11:40,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,719 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:11:40,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,720 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:11:40,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:11:40,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,722 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 [2018-11-22 22:11:40,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,722 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:11:40,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,723 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:11:40,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:11:40,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,726 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 [2018-11-22 22:11:40,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,727 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:11:40,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,727 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:11:40,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:11:40,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:40,729 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 [2018-11-22 22:11:40,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:40,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:40,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:40,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:40,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:11:40,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:11:40,740 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:11:40,743 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:11:40,743 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 22:11:40,744 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:11:40,744 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:11:40,745 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:11:40,745 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_1) = 2*v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_1 + 1 Supporting invariants [] [2018-11-22 22:11:40,783 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-22 22:11:40,793 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:11:40,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:11:40,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:11:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:11:40,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:11:40,927 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:11:40,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-22 22:11:40,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:11:40,937 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 0 case distinctions, treesize of input 37 treesize of output 26 [2018-11-22 22:11:40,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:11:40,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:11:40,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:11:40,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-22 22:11:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:11:40,954 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 [2018-11-22 22:11:40,954 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-22 22:11:41,001 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 57 states and 66 transitions. Complement of second has 15 states. [2018-11-22 22:11:41,002 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 [2018-11-22 22:11:41,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 22:11:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-22 22:11:41,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-22 22:11:41,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:11:41,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-22 22:11:41,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:11:41,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-22 22:11:41,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:11:41,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2018-11-22 22:11:41,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 22:11:41,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 40 states and 48 transitions. [2018-11-22 22:11:41,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-22 22:11:41,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-22 22:11:41,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 48 transitions. [2018-11-22 22:11:41,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:11:41,006 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-22 22:11:41,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 48 transitions. [2018-11-22 22:11:41,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-22 22:11:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-22 22:11:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-22 22:11:41,012 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-22 22:11:41,012 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-22 22:11:41,012 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 22:11:41,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2018-11-22 22:11:41,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 22:11:41,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:11:41,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:11:41,013 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:11:41,013 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:11:41,014 INFO L794 eck$LassoCheckResult]: Stem: 539#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 537#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 538#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 531#L63-2 assume !main_#t~short17;havoc main_#t~mem16;havoc main_#t~mem15;havoc main_#t~short17;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 532#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 541#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 536#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 520#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 540#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 519#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 521#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 553#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 552#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 523#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 553#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 549#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 522#gFINAL assume true; 524#gEXIT >#41#return; 530#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 533#gFINAL assume true; 548#gEXIT >#41#return; 547#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 546#gFINAL assume true; 544#gEXIT >#37#return; 535#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 542#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 534#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 518#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 525#gENTRY [2018-11-22 22:11:41,014 INFO L796 eck$LassoCheckResult]: Loop: 525#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 516#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 517#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 525#gENTRY [2018-11-22 22:11:41,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:41,014 INFO L82 PathProgramCache]: Analyzing trace with hash -853827823, now seen corresponding path program 2 times [2018-11-22 22:11:41,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:11:41,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:11:41,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:41,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:11:41,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:11:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-22 22:11:41,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:11:41,166 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4726e57f-0670-4d65-8f58-ef081f4115ed/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:11:41,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 22:11:41,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 22:11:41,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:11:41,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:11:41,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-22 22:11:41,232 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 10 treesize of output 9 [2018-11-22 22:11:41,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:11:41,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:11:41,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:11:41,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-22 22:11:41,323 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 [2018-11-22 22:11:41,325 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 3 [2018-11-22 22:11:41,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:11:41,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:11:41,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:11:41,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:3 [2018-11-22 22:11:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-22 22:11:41,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:11:41,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2018-11-22 22:11:41,358 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:11:41,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:41,358 INFO L82 PathProgramCache]: Analyzing trace with hash 38883, now seen corresponding path program 2 times [2018-11-22 22:11:41,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:11:41,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:11:41,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:41,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:11:41,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:41,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-22 22:11:41,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-22 22:11:41,456 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 12 Second operand 17 states. [2018-11-22 22:11:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:11:41,605 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2018-11-22 22:11:41,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 22:11:41,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2018-11-22 22:11:41,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 22:11:41,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 46 states and 58 transitions. [2018-11-22 22:11:41,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-22 22:11:41,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-22 22:11:41,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2018-11-22 22:11:41,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:11:41,611 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-11-22 22:11:41,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2018-11-22 22:11:41,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-11-22 22:11:41,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-22 22:11:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-11-22 22:11:41,619 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-22 22:11:41,619 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-22 22:11:41,619 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 22:11:41,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2018-11-22 22:11:41,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 22:11:41,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:11:41,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:11:41,624 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:11:41,624 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:11:41,624 INFO L794 eck$LassoCheckResult]: Stem: 743#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 741#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 742#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 734#L63-2 assume !main_#t~short17;havoc main_#t~mem16;havoc main_#t~mem15;havoc main_#t~short17;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 735#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 746#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 747#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 750#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 759#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 758#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 725#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 732#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 757#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 724#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 732#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 757#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 724#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 732#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 723#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 726#gFINAL assume true; 761#gEXIT >#41#return; 736#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 727#gFINAL assume true; 730#gEXIT >#41#return; 733#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 760#gFINAL assume true; 753#gEXIT >#41#return; 752#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 751#gFINAL assume true; 749#gEXIT >#37#return; 738#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 748#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 737#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 722#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 731#gENTRY [2018-11-22 22:11:41,624 INFO L796 eck$LassoCheckResult]: Loop: 731#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 720#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 721#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 731#gENTRY [2018-11-22 22:11:41,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:41,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1079381827, now seen corresponding path program 3 times [2018-11-22 22:11:41,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:11:41,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:11:41,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:41,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:11:41,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:41,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:41,666 INFO L82 PathProgramCache]: Analyzing trace with hash 38883, now seen corresponding path program 3 times [2018-11-22 22:11:41,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:11:41,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:11:41,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:41,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:11:41,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:41,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:41,672 INFO L82 PathProgramCache]: Analyzing trace with hash 556146087, now seen corresponding path program 4 times [2018-11-22 22:11:41,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:11:41,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:11:41,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:41,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:11:41,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:11:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:11:42,178 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2018-11-22 22:11:42,456 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 107 [2018-11-22 22:11:42,780 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 115 [2018-11-22 22:11:43,263 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 128 [2018-11-22 22:11:43,558 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 117 [2018-11-22 22:11:43,721 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2018-11-22 22:11:44,270 WARN L180 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 141 [2018-11-22 22:11:44,412 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-11-22 22:11:44,415 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:11:44,415 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:11:44,415 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:11:44,415 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:11:44,415 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:11:44,415 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:11:44,415 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:11:44,415 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:11:44,415 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5_true-termination.c.i_Iteration6_Lasso [2018-11-22 22:11:44,415 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:11:44,415 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:11:44,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:11:44,834 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:11:44,834 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:11:44,835 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 [2018-11-22 22:11:44,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:44,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:44,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:44,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:44,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:44,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:44,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:44,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:44,841 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 [2018-11-22 22:11:44,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:44,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:44,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:44,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:44,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:44,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:44,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:44,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:44,842 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 [2018-11-22 22:11:44,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:44,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:44,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:44,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:44,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:44,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:44,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:44,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:44,852 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 [2018-11-22 22:11:44,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:44,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:44,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:44,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:44,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:44,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:44,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:44,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:44,853 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 [2018-11-22 22:11:44,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:44,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:44,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:44,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:44,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:44,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:44,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:44,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:44,855 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 [2018-11-22 22:11:44,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:44,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:44,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:44,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:44,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:44,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:44,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:44,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:44,856 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 [2018-11-22 22:11:44,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:44,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:44,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:44,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:44,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:44,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:44,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:44,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:44,857 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 [2018-11-22 22:11:44,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:44,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:44,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:44,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:44,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:44,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:44,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:44,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:44,859 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 [2018-11-22 22:11:44,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:44,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:44,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:44,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:44,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:44,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:44,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:44,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:44,860 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 [2018-11-22 22:11:44,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:44,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:44,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:44,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:44,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:44,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:44,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:44,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:44,862 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 [2018-11-22 22:11:44,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:44,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:11:44,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:44,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:44,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:44,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:11:44,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:11:44,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:44,863 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 [2018-11-22 22:11:44,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:44,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:44,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:44,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:44,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:11:44,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:11:44,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:11:44,866 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 [2018-11-22 22:11:44,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:11:44,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:11:44,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:11:44,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:11:44,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:11:44,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:11:44,884 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:11:44,892 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-22 22:11:44,892 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-22 22:11:44,892 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:11:44,893 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:11:44,893 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:11:44,893 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_2) = 2*v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_2 + 1 Supporting invariants [] [2018-11-22 22:11:44,912 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-22 22:11:44,920 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:11:44,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:11:44,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:11:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:11:45,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:11:45,014 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:11:45,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-22 22:11:45,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:11:45,017 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 0 case distinctions, treesize of input 37 treesize of output 26 [2018-11-22 22:11:45,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:11:45,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:11:45,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:11:45,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-22 22:11:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:11:45,030 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 [2018-11-22 22:11:45,030 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-22 22:11:45,076 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 50 states and 59 transitions. Complement of second has 15 states. [2018-11-22 22:11:45,076 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 [2018-11-22 22:11:45,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 22:11:45,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-11-22 22:11:45,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 34 letters. Loop has 3 letters. [2018-11-22 22:11:45,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:11:45,077 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 22:11:45,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:11:45,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:11:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:11:45,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:11:45,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:11:45,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-22 22:11:45,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:11:45,163 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 0 case distinctions, treesize of input 37 treesize of output 26 [2018-11-22 22:11:45,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:11:45,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:11:45,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:11:45,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-22 22:11:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:11:45,182 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 [2018-11-22 22:11:45,182 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-22 22:11:45,246 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 50 states and 59 transitions. Complement of second has 15 states. [2018-11-22 22:11:45,247 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 [2018-11-22 22:11:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 22:11:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-11-22 22:11:45,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 34 letters. Loop has 3 letters. [2018-11-22 22:11:45,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:11:45,248 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 22:11:45,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:11:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:11:45,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:11:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:11:45,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:11:45,352 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:11:45,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-22 22:11:45,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:11:45,361 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 0 case distinctions, treesize of input 37 treesize of output 26 [2018-11-22 22:11:45,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:11:45,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:11:45,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:11:45,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-22 22:11:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:11:45,390 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 [2018-11-22 22:11:45,391 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-22 22:11:45,458 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 64 states and 73 transitions. Complement of second has 15 states. [2018-11-22 22:11:45,459 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 [2018-11-22 22:11:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 22:11:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-11-22 22:11:45,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 3 letters. [2018-11-22 22:11:45,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:11:45,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 37 letters. Loop has 3 letters. [2018-11-22 22:11:45,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:11:45,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 6 letters. [2018-11-22 22:11:45,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:11:45,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 73 transitions. [2018-11-22 22:11:45,461 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:11:45,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2018-11-22 22:11:45,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 22:11:45,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 22:11:45,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 22:11:45,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:11:45,462 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:11:45,462 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:11:45,462 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:11:45,462 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-22 22:11:45,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 22:11:45,462 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:11:45,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 22:11:45,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 10:11:45 BoogieIcfgContainer [2018-11-22 22:11:45,468 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 22:11:45,468 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:11:45,468 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:11:45,468 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:11:45,468 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:11:36" (3/4) ... [2018-11-22 22:11:45,471 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 22:11:45,471 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:11:45,472 INFO L168 Benchmark]: Toolchain (without parser) took 9393.14 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 381.7 MB). Free memory was 953.8 MB in the beginning and 869.1 MB in the end (delta: 84.7 MB). Peak memory consumption was 466.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:11:45,472 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:11:45,473 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.07 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:11:45,473 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.81 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:11:45,473 INFO L168 Benchmark]: Boogie Preprocessor took 51.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -213.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-22 22:11:45,474 INFO L168 Benchmark]: RCFGBuilder took 175.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-22 22:11:45,474 INFO L168 Benchmark]: BuchiAutomizer took 8978.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 222.8 MB). Free memory was 1.1 GB in the beginning and 869.1 MB in the end (delta: 266.8 MB). Peak memory consumption was 489.6 MB. Max. memory is 11.5 GB. [2018-11-22 22:11:45,475 INFO L168 Benchmark]: Witness Printer took 3.37 ms. Allocated memory is still 1.4 GB. Free memory is still 869.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:11:45,477 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 160.07 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 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 21.81 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -213.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 175.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8978.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 222.8 MB). Free memory was 1.1 GB in the beginning and 869.1 MB in the end (delta: 266.8 MB). Peak memory consumption was 489.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.37 ms. Allocated memory is still 1.4 GB. Free memory is still 869.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * \old(v) + 1 and consists of 5 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.9s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 7.4s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 14/14 HoareTripleCheckerStatistics: 116 SDtfs, 91 SDslu, 217 SDs, 0 SdLazy, 340 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital338 mio100 ax100 hnf100 lsp98 ukn35 mio100 lsp25 div100 bol100 ite100 ukn100 eq186 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 2ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...