./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_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_febe3611-61a1-42db-868c-1593fdec7f59/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_febe3611-61a1-42db-868c-1593fdec7f59/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_febe3611-61a1-42db-868c-1593fdec7f59/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_febe3611-61a1-42db-868c-1593fdec7f59/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_febe3611-61a1-42db-868c-1593fdec7f59/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_febe3611-61a1-42db-868c-1593fdec7f59/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 18b42b65120149c30866fbc5b5479df029781f63 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:53:58,854 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:53:58,856 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:53:58,864 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:53:58,864 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:53:58,865 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:53:58,865 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:53:58,867 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:53:58,868 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:53:58,868 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:53:58,869 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:53:58,869 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:53:58,870 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:53:58,870 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:53:58,871 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:53:58,872 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:53:58,872 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:53:58,873 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:53:58,874 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:53:58,875 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:53:58,876 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:53:58,877 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:53:58,878 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:53:58,879 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:53:58,879 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:53:58,879 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:53:58,880 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:53:58,880 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:53:58,881 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:53:58,882 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:53:58,882 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:53:58,882 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:53:58,882 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:53:58,883 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:53:58,883 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:53:58,884 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:53:58,884 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_febe3611-61a1-42db-868c-1593fdec7f59/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 14:53:58,893 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:53:58,894 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:53:58,894 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:53:58,895 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:53:58,895 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:53:58,895 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 14:53:58,895 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 14:53:58,895 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 14:53:58,895 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 14:53:58,895 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 14:53:58,896 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 14:53:58,896 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:53:58,896 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 14:53:58,896 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:53:58,896 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:53:58,896 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 14:53:58,896 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 14:53:58,896 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 14:53:58,897 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:53:58,897 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 14:53:58,897 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:53:58,897 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 14:53:58,897 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:53:58,897 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:53:58,897 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 14:53:58,897 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:53:58,898 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:53:58,898 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 14:53:58,898 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 14:53:58,899 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_febe3611-61a1-42db-868c-1593fdec7f59/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 -> 18b42b65120149c30866fbc5b5479df029781f63 [2018-11-23 14:53:58,921 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:53:58,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:53:58,932 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:53:58,933 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:53:58,934 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:53:58,934 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_febe3611-61a1-42db-868c-1593fdec7f59/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i [2018-11-23 14:53:58,984 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_febe3611-61a1-42db-868c-1593fdec7f59/bin-2019/uautomizer/data/8233fcee1/99420b37957f4b3c8f17e0e0a5a2e107/FLAG49d4cbe76 [2018-11-23 14:53:59,313 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:53:59,313 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_febe3611-61a1-42db-868c-1593fdec7f59/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i [2018-11-23 14:53:59,318 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_febe3611-61a1-42db-868c-1593fdec7f59/bin-2019/uautomizer/data/8233fcee1/99420b37957f4b3c8f17e0e0a5a2e107/FLAG49d4cbe76 [2018-11-23 14:53:59,328 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_febe3611-61a1-42db-868c-1593fdec7f59/bin-2019/uautomizer/data/8233fcee1/99420b37957f4b3c8f17e0e0a5a2e107 [2018-11-23 14:53:59,330 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:53:59,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:53:59,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:53:59,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:53:59,334 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:53:59,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:53:59" (1/1) ... [2018-11-23 14:53:59,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7219270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:59, skipping insertion in model container [2018-11-23 14:53:59,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:53:59" (1/1) ... [2018-11-23 14:53:59,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:53:59,355 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:53:59,463 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:53:59,469 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:53:59,481 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:53:59,491 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:53:59,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:59 WrapperNode [2018-11-23 14:53:59,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:53:59,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:53:59,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:53:59,492 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:53:59,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:59" (1/1) ... [2018-11-23 14:53:59,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:59" (1/1) ... [2018-11-23 14:53:59,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:53:59,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:53:59,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:53:59,525 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:53:59,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:59" (1/1) ... [2018-11-23 14:53:59,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:59" (1/1) ... [2018-11-23 14:53:59,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:59" (1/1) ... [2018-11-23 14:53:59,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:59" (1/1) ... [2018-11-23 14:53:59,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:59" (1/1) ... [2018-11-23 14:53:59,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:59" (1/1) ... [2018-11-23 14:53:59,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:59" (1/1) ... [2018-11-23 14:53:59,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:53:59,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:53:59,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:53:59,582 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:53:59,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_febe3611-61a1-42db-868c-1593fdec7f59/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-23 14:53:59,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:53:59,620 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-11-23 14:53:59,620 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-11-23 14:53:59,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:53:59,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:53:59,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:53:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:53:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:53:59,763 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:53:59,763 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 14:53:59,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:53:59 BoogieIcfgContainer [2018-11-23 14:53:59,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:53:59,764 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 14:53:59,764 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 14:53:59,768 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 14:53:59,768 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:53:59,769 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:53:59" (1/3) ... [2018-11-23 14:53:59,769 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@108a6053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:53:59, skipping insertion in model container [2018-11-23 14:53:59,770 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:53:59,770 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:59" (2/3) ... [2018-11-23 14:53:59,770 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@108a6053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:53:59, skipping insertion in model container [2018-11-23 14:53:59,770 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:53:59,770 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:53:59" (3/3) ... [2018-11-23 14:53:59,772 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11B_true-termination.c.i [2018-11-23 14:53:59,822 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:53:59,823 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 14:53:59,823 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 14:53:59,823 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 14:53:59,824 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:53:59,824 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:53:59,824 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 14:53:59,824 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:53:59,824 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 14:53:59,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-23 14:53:59,854 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 14:53:59,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:53:59,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:53:59,860 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 14:53:59,860 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:53:59,860 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 14:53:59,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-23 14:53:59,861 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 14:53:59,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:53:59,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:53:59,862 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 14:53:59,862 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:53:59,868 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 19#L28-3true [2018-11-23 14:53:59,868 INFO L796 eck$LassoCheckResult]: Loop: 19#L28-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 4#L28-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 12#L33true call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 3#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 7#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 15#recFINALtrue assume true; 13#recEXITtrue >#39#return; 10#L33-1true assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 5#L33-3true call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite12;havoc main_#t~mem13;havoc main_#t~ret11; 19#L28-3true [2018-11-23 14:53:59,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:53:59,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-11-23 14:53:59,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:53:59,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:53:59,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:53:59,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:53:59,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:53:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:53:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:53:59,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:53:59,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1673639481, now seen corresponding path program 1 times [2018-11-23 14:53:59,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:53:59,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:53:59,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:53:59,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:53:59,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:53:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:53:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:54:00,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:54:00,001 INFO L82 PathProgramCache]: Analyzing trace with hash -508919995, now seen corresponding path program 1 times [2018-11-23 14:54:00,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:54:00,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:54:00,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:00,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:54:00,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:54:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:54:00,438 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-11-23 14:54:00,547 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:54:00,548 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:54:00,548 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:54:00,548 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:54:00,549 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:54:00,549 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:54:00,549 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:54:00,549 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:54:00,549 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B_true-termination.c.i_Iteration1_Lasso [2018-11-23 14:54:00,549 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:54:00,549 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:54:00,563 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-23 14:54:00,567 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-23 14:54:00,570 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-23 14:54:00,572 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-23 14:54:00,573 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-23 14:54:00,575 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-23 14:54:00,576 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-23 14:54:00,579 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-23 14:54:00,582 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-23 14:54:00,772 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2018-11-23 14:54:00,773 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-23 14:54:00,965 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:54:00,968 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:54:00,970 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-23 14:54:00,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:00,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:00,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:00,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:00,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:00,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:00,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:00,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:00,975 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-23 14:54:00,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:00,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:00,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:00,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:00,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:00,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:00,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:00,981 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-23 14:54:00,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:00,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:00,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:00,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:00,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:00,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:00,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:00,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:00,984 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-23 14:54:00,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:00,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:00,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:00,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:00,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:00,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:00,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:00,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:00,986 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-23 14:54:00,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:00,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:00,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:00,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:00,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:00,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:00,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:00,990 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-23 14:54:00,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:00,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:00,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:00,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:00,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:00,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:00,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:00,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:00,993 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-23 14:54:00,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:00,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:00,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:00,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:00,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:00,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:00,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:00,997 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-23 14:54:00,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:00,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:00,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:00,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:00,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:00,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:00,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:00,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:01,000 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-23 14:54:01,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:01,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:01,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:01,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:01,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:01,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:01,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:01,021 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-23 14:54:01,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:01,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:01,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:01,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:01,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:01,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:01,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:01,037 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-23 14:54:01,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:01,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:01,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:01,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:01,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:01,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:01,052 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:54:01,062 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 14:54:01,062 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 14:54:01,064 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:54:01,065 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 14:54:01,066 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:54:01,066 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2018-11-23 14:54:01,078 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 14:54:01,082 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 14:54:01,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:54:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:54:01,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:54:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:54:01,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:54:01,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:54:01,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:54:01,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 14:54:01,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:54:01,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 16 [2018-11-23 14:54:01,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-23 14:54:01,197 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:54:01,200 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:54:01,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:54:01,203 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:7 [2018-11-23 14:54:01,237 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-23 14:54:01,247 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-23 14:54:01,248 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 6 states. [2018-11-23 14:54:01,331 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 6 states. Result 65 states and 78 transitions. Complement of second has 18 states. [2018-11-23 14:54:01,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-23 14:54:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 14:54:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-11-23 14:54:01,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 2 letters. Loop has 9 letters. [2018-11-23 14:54:01,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:54:01,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 11 letters. Loop has 9 letters. [2018-11-23 14:54:01,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:54:01,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 2 letters. Loop has 18 letters. [2018-11-23 14:54:01,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:54:01,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 78 transitions. [2018-11-23 14:54:01,343 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-23 14:54:01,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 47 states and 58 transitions. [2018-11-23 14:54:01,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 14:54:01,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-23 14:54:01,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 58 transitions. [2018-11-23 14:54:01,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:54:01,351 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-11-23 14:54:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 58 transitions. [2018-11-23 14:54:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-23 14:54:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 14:54:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2018-11-23 14:54:01,378 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-11-23 14:54:01,378 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-11-23 14:54:01,378 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 14:54:01,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 57 transitions. [2018-11-23 14:54:01,380 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-23 14:54:01,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:54:01,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:54:01,381 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:54:01,381 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 14:54:01,381 INFO L794 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 192#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 193#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 208#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 188#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 200#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 187#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 175#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 173#recENTRY [2018-11-23 14:54:01,381 INFO L796 eck$LassoCheckResult]: Loop: 173#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 176#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 174#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 173#recENTRY [2018-11-23 14:54:01,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:54:01,381 INFO L82 PathProgramCache]: Analyzing trace with hash -15731550, now seen corresponding path program 1 times [2018-11-23 14:54:01,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:54:01,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:54:01,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:01,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:54:01,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:54:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:54:01,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:54:01,414 INFO L82 PathProgramCache]: Analyzing trace with hash 29951, now seen corresponding path program 1 times [2018-11-23 14:54:01,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:54:01,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:54:01,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:01,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:54:01,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:54:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:54:01,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:54:01,428 INFO L82 PathProgramCache]: Analyzing trace with hash -507170626, now seen corresponding path program 2 times [2018-11-23 14:54:01,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:54:01,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:54:01,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:01,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:54:01,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:54:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:54:01,951 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2018-11-23 14:54:02,288 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 106 [2018-11-23 14:54:02,368 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:54:02,369 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:54:02,369 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:54:02,369 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:54:02,369 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:54:02,369 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:54:02,369 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:54:02,369 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:54:02,369 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B_true-termination.c.i_Iteration2_Lasso [2018-11-23 14:54:02,369 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:54:02,369 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:54:02,373 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-23 14:54:02,378 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-23 14:54:02,379 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-23 14:54:02,381 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-23 14:54:02,382 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-23 14:54:02,383 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-23 14:54:02,385 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-23 14:54:02,386 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-23 14:54:02,387 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-23 14:54:02,388 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-23 14:54:02,389 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-23 14:54:02,390 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-23 14:54:02,392 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-23 14:54:02,393 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-23 14:54:02,394 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-23 14:54:02,394 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-23 14:54:02,395 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-23 14:54:02,396 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-23 14:54:02,397 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-23 14:54:02,398 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-23 14:54:02,399 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-23 14:54:02,400 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-23 14:54:02,499 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-23 14:54:02,500 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-23 14:54:02,501 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-23 14:54:02,502 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-23 14:54:02,503 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-23 14:54:02,504 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-23 14:54:02,505 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-23 14:54:02,506 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-23 14:54:02,506 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-23 14:54:02,507 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-23 14:54:02,508 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-23 14:54:02,671 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:54:02,671 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:54:02,671 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-23 14:54:02,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:02,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:02,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:02,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,674 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-23 14:54:02,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:02,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:02,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:02,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,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-23 14:54:02,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:02,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:02,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:02,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,677 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-23 14:54:02,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:02,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:02,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:02,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,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-23 14:54:02,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:02,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:02,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:02,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,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-23 14:54:02,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:02,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:02,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:02,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,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-23 14:54:02,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:02,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:02,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,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-23 14:54:02,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:02,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:02,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:02,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,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-23 14:54:02,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:02,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:02,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:02,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,692 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-23 14:54:02,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:02,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:02,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:02,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,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-23 14:54:02,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:02,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:02,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:02,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,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-23 14:54:02,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:02,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:02,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:02,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,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-23 14:54:02,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:02,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:02,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:02,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,699 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-23 14:54:02,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:02,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:02,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:02,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,701 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-23 14:54:02,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:02,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:02,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:02,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,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-23 14:54:02,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:02,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:02,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:02,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,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-23 14:54:02,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:02,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:02,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:02,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,707 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-23 14:54:02,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:02,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:02,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:02,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,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-23 14:54:02,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:02,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:02,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:02,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,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-23 14:54:02,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:02,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:02,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,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-23 14:54:02,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:02,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:02,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:02,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,727 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-23 14:54:02,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:02,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:02,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,733 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-23 14:54:02,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:02,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:02,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,736 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-23 14:54:02,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,737 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:54:02,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,738 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:54:02,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:02,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,740 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-23 14:54:02,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:02,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:02,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,743 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-23 14:54:02,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,743 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:54:02,744 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:54:02,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,745 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 14:54:02,745 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 14:54:02,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,754 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-23 14:54:02,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:02,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:02,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,759 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-23 14:54:02,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:02,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:02,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,768 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-23 14:54:02,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:02,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:02,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:02,770 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-23 14:54:02,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:02,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:02,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:02,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:02,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:02,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:02,787 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:54:02,797 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 14:54:02,797 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 14:54:02,798 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:54:02,798 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-11-23 14:54:02,799 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:54:02,799 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select old(#memory_int) rec_#in~op.base) 0)_1) = 2*v_rep(select (select old(#memory_int) rec_#in~op.base) 0)_1 + 3 Supporting invariants [1*v_rep(select (select old(#memory_int) rec_#in~op.base) 0)_1 + 1 >= 0, -1*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1*v_rep(select (select old(#memory_int) rec_#in~op.base) 0)_1 >= 0] [2018-11-23 14:54:02,833 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 14:54:02,836 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 14:54:02,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:54:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:54:02,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:54:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:54:02,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:54:02,901 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 23 treesize of output 19 [2018-11-23 14:54:02,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 14:54:02,904 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:54:02,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:54:02,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:54:02,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:22 [2018-11-23 14:54:02,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-11-23 14:54:02,974 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 33 treesize of output 32 [2018-11-23 14:54:02,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:54:03,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:54:03,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-11-23 14:54:03,020 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 14:54:03,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:54:03,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-23 14:54:03,057 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:42, output treesize:68 [2018-11-23 14:54:03,085 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-23 14:54:03,086 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-23 14:54:03,086 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 57 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-23 14:54:03,158 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 57 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 128 states and 165 transitions. Complement of second has 18 states. [2018-11-23 14:54:03,158 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-23 14:54:03,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 14:54:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2018-11-23 14:54:03,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-23 14:54:03,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:54:03,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-23 14:54:03,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:54:03,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-23 14:54:03,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:54:03,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 165 transitions. [2018-11-23 14:54:03,164 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-23 14:54:03,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 110 states and 147 transitions. [2018-11-23 14:54:03,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2018-11-23 14:54:03,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-11-23 14:54:03,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 147 transitions. [2018-11-23 14:54:03,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:54:03,169 INFO L705 BuchiCegarLoop]: Abstraction has 110 states and 147 transitions. [2018-11-23 14:54:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 147 transitions. [2018-11-23 14:54:03,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2018-11-23 14:54:03,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 14:54:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2018-11-23 14:54:03,179 INFO L728 BuchiCegarLoop]: Abstraction has 104 states and 135 transitions. [2018-11-23 14:54:03,179 INFO L608 BuchiCegarLoop]: Abstraction has 104 states and 135 transitions. [2018-11-23 14:54:03,179 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 14:54:03,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 135 transitions. [2018-11-23 14:54:03,181 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-23 14:54:03,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:54:03,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:54:03,181 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:54:03,181 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:54:03,182 INFO L794 eck$LassoCheckResult]: Stem: 467#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 457#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 458#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 485#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 509#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 519#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 531#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 530#recFINAL assume true; 508#recEXIT >#39#return; 468#L33-1 assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; 453#L33-3 [2018-11-23 14:54:03,182 INFO L796 eck$LassoCheckResult]: Loop: 453#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite12;havoc main_#t~mem13;havoc main_#t~ret11; 454#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 500#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 491#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 512#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 504#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 505#recFINAL assume true; 490#recEXIT >#39#return; 487#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 453#L33-3 [2018-11-23 14:54:03,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:54:03,182 INFO L82 PathProgramCache]: Analyzing trace with hash 2061793209, now seen corresponding path program 1 times [2018-11-23 14:54:03,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:54:03,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:54:03,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:03,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:54:03,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:54:03,239 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-23 14:54:03,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:54:03,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:54:03,242 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 14:54:03,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:54:03,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1530037457, now seen corresponding path program 2 times [2018-11-23 14:54:03,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:54:03,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:54:03,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:03,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:54:03,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:54:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:54:03,520 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2018-11-23 14:54:03,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:54:03,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:54:03,559 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. cyclomatic complexity: 41 Second operand 5 states. [2018-11-23 14:54:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:54:03,577 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2018-11-23 14:54:03,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 14:54:03,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 123 transitions. [2018-11-23 14:54:03,579 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-23 14:54:03,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 92 states and 117 transitions. [2018-11-23 14:54:03,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-11-23 14:54:03,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-11-23 14:54:03,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 117 transitions. [2018-11-23 14:54:03,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:54:03,581 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 117 transitions. [2018-11-23 14:54:03,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 117 transitions. [2018-11-23 14:54:03,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-23 14:54:03,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 14:54:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2018-11-23 14:54:03,586 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 115 transitions. [2018-11-23 14:54:03,586 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 115 transitions. [2018-11-23 14:54:03,586 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 14:54:03,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 115 transitions. [2018-11-23 14:54:03,587 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-23 14:54:03,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:54:03,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:54:03,590 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:54:03,590 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:54:03,591 INFO L794 eck$LassoCheckResult]: Stem: 677#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 667#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 668#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 694#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 711#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 715#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 713#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 670#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 709#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 669#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 671#recFINAL assume true; 692#recEXIT >#37#return; 714#L19-1 #res := #t~ret5;havoc #t~ret5; 712#recFINAL assume true; 710#recEXIT >#39#return; 675#L33-1 assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; 663#L33-3 [2018-11-23 14:54:03,591 INFO L796 eck$LassoCheckResult]: Loop: 663#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite12;havoc main_#t~mem13;havoc main_#t~ret11; 664#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 703#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 680#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 702#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 706#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 705#recFINAL assume true; 704#recEXIT >#39#return; 696#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 663#L33-3 [2018-11-23 14:54:03,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:54:03,591 INFO L82 PathProgramCache]: Analyzing trace with hash 970657719, now seen corresponding path program 1 times [2018-11-23 14:54:03,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:54:03,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:54:03,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:03,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:54:03,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:54:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 14:54:03,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:54:03,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 14:54:03,654 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 14:54:03,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:54:03,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1530037457, now seen corresponding path program 3 times [2018-11-23 14:54:03,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:54:03,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:54:03,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:03,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:54:03,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:54:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:54:03,855 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2018-11-23 14:54:03,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 14:54:03,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 14:54:03,883 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. cyclomatic complexity: 33 Second operand 6 states. [2018-11-23 14:54:03,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:54:03,903 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2018-11-23 14:54:03,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 14:54:03,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 96 transitions. [2018-11-23 14:54:03,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 14:54:03,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 52 states and 63 transitions. [2018-11-23 14:54:03,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 14:54:03,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 14:54:03,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 63 transitions. [2018-11-23 14:54:03,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:54:03,907 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-11-23 14:54:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 63 transitions. [2018-11-23 14:54:03,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-23 14:54:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 14:54:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2018-11-23 14:54:03,910 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2018-11-23 14:54:03,910 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2018-11-23 14:54:03,910 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 14:54:03,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 60 transitions. [2018-11-23 14:54:03,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 14:54:03,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:54:03,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:54:03,911 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:54:03,911 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 14:54:03,911 INFO L794 eck$LassoCheckResult]: Stem: 846#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 840#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 841#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 835#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 836#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 860#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 867#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 848#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 869#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 873#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 871#recFINAL assume true; 852#recEXIT >#37#return; 853#L19-1 #res := #t~ret5;havoc #t~ret5; 865#recFINAL assume true; 861#recEXIT >#39#return; 845#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 837#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite12;havoc main_#t~mem13;havoc main_#t~ret11; 838#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 834#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 827#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 826#recENTRY [2018-11-23 14:54:03,911 INFO L796 eck$LassoCheckResult]: Loop: 826#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 828#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 829#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 826#recENTRY [2018-11-23 14:54:03,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:54:03,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1312873862, now seen corresponding path program 1 times [2018-11-23 14:54:03,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:54:03,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:54:03,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:03,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:54:03,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:54:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:54:03,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:54:03,936 INFO L82 PathProgramCache]: Analyzing trace with hash 29951, now seen corresponding path program 2 times [2018-11-23 14:54:03,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:54:03,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:54:03,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:03,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:54:03,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:54:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:54:03,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:54:03,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1853025306, now seen corresponding path program 2 times [2018-11-23 14:54:03,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:54:03,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:54:03,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:03,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:54:03,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:54:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:54:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:54:04,331 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2018-11-23 14:54:05,200 WARN L180 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 178 [2018-11-23 14:54:05,343 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-11-23 14:54:05,497 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-11-23 14:54:05,605 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-11-23 14:54:05,606 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:54:05,607 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:54:05,607 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:54:05,607 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:54:05,607 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:54:05,607 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:54:05,607 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:54:05,607 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:54:05,607 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B_true-termination.c.i_Iteration5_Lasso [2018-11-23 14:54:05,607 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:54:05,607 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:54:05,611 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-23 14:54:05,614 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-23 14:54:05,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-23 14:54:05,616 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-23 14:54:05,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-23 14:54:05,618 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-23 14:54:05,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-23 14:54:05,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-23 14:54:05,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-23 14:54:05,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-23 14:54:05,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-23 14:54:05,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-23 14:54:05,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-23 14:54:05,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-23 14:54:05,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-23 14:54:05,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-23 14:54:05,723 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-23 14:54:05,724 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-23 14:54:05,725 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-23 14:54:05,726 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-23 14:54:05,727 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-23 14:54:05,728 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-23 14:54:05,729 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-23 14:54:05,730 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-23 14:54:05,731 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-23 14:54:05,731 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-23 14:54:05,732 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-23 14:54:05,733 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-23 14:54:05,734 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-23 14:54:05,735 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-23 14:54:05,735 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-23 14:54:05,736 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-23 14:54:05,737 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-23 14:54:05,870 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:54:05,871 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:54:05,871 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-23 14:54:05,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:05,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:05,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:05,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,873 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-23 14:54:05,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:05,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:05,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:05,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,874 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-23 14:54:05,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:05,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:05,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:05,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,875 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-23 14:54:05,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:05,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:05,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:05,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,876 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-23 14:54:05,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:05,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:05,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,878 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-23 14:54:05,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:05,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:05,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:05,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,880 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-23 14:54:05,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:05,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:05,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:05,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,882 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-23 14:54:05,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:05,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:05,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:05,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,883 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-23 14:54:05,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:05,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:05,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:05,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,885 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-23 14:54:05,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:05,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:05,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:05,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,887 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-23 14:54:05,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:05,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:05,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:05,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,888 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-23 14:54:05,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,889 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:05,889 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:05,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,890 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-23 14:54:05,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:05,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:05,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:05,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,892 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-23 14:54:05,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:05,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:05,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:05,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,893 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-23 14:54:05,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:54:05,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:54:05,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:54:05,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,895 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-23 14:54:05,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:05,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:05,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,897 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-23 14:54:05,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:05,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:05,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,902 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-23 14:54:05,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:05,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:05,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,905 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-23 14:54:05,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:05,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:05,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,907 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-23 14:54:05,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,907 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:54:05,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,908 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:54:05,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:05,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,909 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-23 14:54:05,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,910 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:54:05,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,910 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:54:05,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:05,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,912 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-23 14:54:05,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,912 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:54:05,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,913 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:54:05,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:05,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,914 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-23 14:54:05,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,915 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:54:05,915 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:54:05,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,916 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 14:54:05,917 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 14:54:05,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,922 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-23 14:54:05,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:05,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:05,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:54:05,929 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-23 14:54:05,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:54:05,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:54:05,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:54:05,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:54:05,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:54:05,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:54:05,934 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:54:05,937 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 14:54:05,937 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 14:54:05,937 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:54:05,938 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 14:54:05,938 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:54:05,938 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2018-11-23 14:54:05,973 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 14:54:05,977 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 14:54:05,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:54:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:54:06,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:54:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:54:06,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:54:06,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-23 14:54:06,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-23 14:54:06,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:54:06,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:54:06,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-23 14:54:06,097 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 14:54:06,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:54:06,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 14:54:06,121 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-23 14:54:06,141 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-23 14:54:06,142 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-23 14:54:06,142 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-23 14:54:06,197 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 78 states and 96 transitions. Complement of second has 16 states. [2018-11-23 14:54:06,197 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-23 14:54:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 14:54:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-11-23 14:54:06,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 20 letters. Loop has 3 letters. [2018-11-23 14:54:06,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:54:06,198 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 14:54:06,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:54:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:54:06,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:54:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:54:06,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:54:06,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-23 14:54:06,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-23 14:54:06,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:54:06,298 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:54:06,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-23 14:54:06,305 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 14:54:06,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:54:06,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 14:54:06,337 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-23 14:54:06,352 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-23 14:54:06,352 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-23 14:54:06,352 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-23 14:54:06,390 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 78 states and 96 transitions. Complement of second has 16 states. [2018-11-23 14:54:06,390 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-23 14:54:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 14:54:06,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-11-23 14:54:06,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 20 letters. Loop has 3 letters. [2018-11-23 14:54:06,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:54:06,391 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 14:54:06,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:54:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:54:06,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:54:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:54:06,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:54:06,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-23 14:54:06,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-23 14:54:06,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:54:06,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:54:06,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-23 14:54:06,503 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 14:54:06,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:54:06,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 14:54:06,534 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-23 14:54:06,550 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-23 14:54:06,550 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-23 14:54:06,551 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-23 14:54:06,604 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 76 states and 88 transitions. Complement of second has 17 states. [2018-11-23 14:54:06,605 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-23 14:54:06,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 14:54:06,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-23 14:54:06,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 20 letters. Loop has 3 letters. [2018-11-23 14:54:06,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:54:06,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 23 letters. Loop has 3 letters. [2018-11-23 14:54:06,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:54:06,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 20 letters. Loop has 6 letters. [2018-11-23 14:54:06,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:54:06,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 88 transitions. [2018-11-23 14:54:06,608 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 14:54:06,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 0 states and 0 transitions. [2018-11-23 14:54:06,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 14:54:06,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 14:54:06,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 14:54:06,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:54:06,609 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:54:06,609 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:54:06,609 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:54:06,609 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 14:54:06,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 14:54:06,609 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 14:54:06,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 14:54:06,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:54:06 BoogieIcfgContainer [2018-11-23 14:54:06,615 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 14:54:06,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:54:06,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:54:06,616 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:54:06,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:53:59" (3/4) ... [2018-11-23 14:54:06,619 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 14:54:06,619 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:54:06,620 INFO L168 Benchmark]: Toolchain (without parser) took 7289.67 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 329.8 MB). Free memory was 953.8 MB in the beginning and 1.0 GB in the end (delta: -93.1 MB). Peak memory consumption was 236.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:54:06,621 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:54:06,621 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-23 14:54:06,621 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.17 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-23 14:54:06,622 INFO L168 Benchmark]: Boogie Preprocessor took 56.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -200.5 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 14:54:06,622 INFO L168 Benchmark]: RCFGBuilder took 181.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-23 14:54:06,622 INFO L168 Benchmark]: BuchiAutomizer took 6851.16 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.8 MB). Peak memory consumption was 259.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:54:06,623 INFO L168 Benchmark]: Witness Printer took 3.91 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:54:06,625 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 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 33.17 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 56.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -200.5 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 181.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6851.16 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.8 MB). Peak memory consumption was 259.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.91 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 9 locations. One deterministic module has affine ranking function 2 * \old(unknown-#memory_int-unknown)[op][0] + 3 and consists of 6 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.4s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 104 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 82 SDtfs, 59 SDslu, 126 SDs, 0 SdLazy, 176 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital357 mio100 ax100 hnf100 lsp97 ukn42 mio100 lsp29 div100 bol100 ite100 ukn100 eq176 hnf89 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...