./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_33e7efe3-fb9f-4ed0-a737-6211621b8a07/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_33e7efe3-fb9f-4ed0-a737-6211621b8a07/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_33e7efe3-fb9f-4ed0-a737-6211621b8a07/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_33e7efe3-fb9f-4ed0-a737-6211621b8a07/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_33e7efe3-fb9f-4ed0-a737-6211621b8a07/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_33e7efe3-fb9f-4ed0-a737-6211621b8a07/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 32bit --witnessprinter.graph.data.programhash 2e43c76eef4a87266f6a401a44aa5422f52ed742 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 08:55:10,552 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 08:55:10,553 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 08:55:10,560 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 08:55:10,560 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 08:55:10,560 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 08:55:10,561 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 08:55:10,562 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 08:55:10,563 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 08:55:10,564 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 08:55:10,564 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 08:55:10,564 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 08:55:10,565 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 08:55:10,566 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 08:55:10,566 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 08:55:10,567 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 08:55:10,567 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 08:55:10,568 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 08:55:10,569 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 08:55:10,570 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 08:55:10,571 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 08:55:10,571 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 08:55:10,573 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 08:55:10,573 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 08:55:10,573 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 08:55:10,574 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 08:55:10,574 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 08:55:10,575 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 08:55:10,575 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 08:55:10,576 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 08:55:10,576 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 08:55:10,576 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 08:55:10,576 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 08:55:10,577 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 08:55:10,577 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 08:55:10,577 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 08:55:10,578 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_33e7efe3-fb9f-4ed0-a737-6211621b8a07/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 08:55:10,586 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 08:55:10,586 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 08:55:10,587 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 08:55:10,587 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 08:55:10,587 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 08:55:10,587 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 08:55:10,587 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 08:55:10,587 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 08:55:10,587 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 08:55:10,588 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 08:55:10,588 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 08:55:10,588 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 08:55:10,588 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 08:55:10,588 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 08:55:10,588 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 08:55:10,588 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 08:55:10,588 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 08:55:10,589 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 08:55:10,589 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 08:55:10,589 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 08:55:10,589 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 08:55:10,589 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 08:55:10,589 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 08:55:10,589 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 08:55:10,589 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 08:55:10,590 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 08:55:10,590 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 08:55:10,590 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 08:55:10,590 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 08:55:10,590 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 08:55:10,590 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 08:55:10,591 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 08:55:10,591 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_33e7efe3-fb9f-4ed0-a737-6211621b8a07/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e43c76eef4a87266f6a401a44aa5422f52ed742 [2018-12-08 08:55:10,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 08:55:10,619 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 08:55:10,621 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 08:55:10,622 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 08:55:10,622 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 08:55:10,623 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_33e7efe3-fb9f-4ed0-a737-6211621b8a07/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-12-08 08:55:10,665 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33e7efe3-fb9f-4ed0-a737-6211621b8a07/bin-2019/uautomizer/data/0bd32c8c9/946a33bfd0c04d44a38e666a3824ec65/FLAGa21c01407 [2018-12-08 08:55:11,048 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 08:55:11,048 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_33e7efe3-fb9f-4ed0-a737-6211621b8a07/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-12-08 08:55:11,055 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33e7efe3-fb9f-4ed0-a737-6211621b8a07/bin-2019/uautomizer/data/0bd32c8c9/946a33bfd0c04d44a38e666a3824ec65/FLAGa21c01407 [2018-12-08 08:55:11,407 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_33e7efe3-fb9f-4ed0-a737-6211621b8a07/bin-2019/uautomizer/data/0bd32c8c9/946a33bfd0c04d44a38e666a3824ec65 [2018-12-08 08:55:11,412 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 08:55:11,415 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 08:55:11,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 08:55:11,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 08:55:11,423 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 08:55:11,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:55:11" (1/1) ... [2018-12-08 08:55:11,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b808521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:55:11, skipping insertion in model container [2018-12-08 08:55:11,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:55:11" (1/1) ... [2018-12-08 08:55:11,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 08:55:11,464 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 08:55:11,694 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:55:11,705 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 08:55:11,739 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:55:11,772 INFO L195 MainTranslator]: Completed translation [2018-12-08 08:55:11,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:55:11 WrapperNode [2018-12-08 08:55:11,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 08:55:11,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 08:55:11,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 08:55:11,773 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 08:55:11,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:55:11" (1/1) ... [2018-12-08 08:55:11,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:55:11" (1/1) ... [2018-12-08 08:55:11,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 08:55:11,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 08:55:11,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 08:55:11,804 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 08:55:11,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:55:11" (1/1) ... [2018-12-08 08:55:11,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:55:11" (1/1) ... [2018-12-08 08:55:11,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:55:11" (1/1) ... [2018-12-08 08:55:11,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:55:11" (1/1) ... [2018-12-08 08:55:11,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:55:11" (1/1) ... [2018-12-08 08:55:11,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:55:11" (1/1) ... [2018-12-08 08:55:11,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:55:11" (1/1) ... [2018-12-08 08:55:11,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 08:55:11,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 08:55:11,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 08:55:11,822 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 08:55:11,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:55:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33e7efe3-fb9f-4ed0-a737-6211621b8a07/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-12-08 08:55:11,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 08:55:11,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 08:55:11,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 08:55:11,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 08:55:11,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 08:55:11,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 08:55:11,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 08:55:12,026 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 08:55:12,026 INFO L280 CfgBuilder]: Removed 20 assue(true) statements. [2018-12-08 08:55:12,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:55:12 BoogieIcfgContainer [2018-12-08 08:55:12,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 08:55:12,027 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 08:55:12,027 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 08:55:12,030 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 08:55:12,031 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:55:12,031 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 08:55:11" (1/3) ... [2018-12-08 08:55:12,031 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9eda1c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:55:12, skipping insertion in model container [2018-12-08 08:55:12,032 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:55:12,032 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:55:11" (2/3) ... [2018-12-08 08:55:12,032 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9eda1c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:55:12, skipping insertion in model container [2018-12-08 08:55:12,032 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:55:12,032 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:55:12" (3/3) ... [2018-12-08 08:55:12,033 INFO L375 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-12-08 08:55:12,063 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 08:55:12,064 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 08:55:12,064 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 08:55:12,064 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 08:55:12,064 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 08:55:12,064 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 08:55:12,064 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 08:55:12,064 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 08:55:12,064 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 08:55:12,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-12-08 08:55:12,086 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 08:55:12,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:55:12,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:55:12,091 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:55:12,091 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:55:12,091 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 08:55:12,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-12-08 08:55:12,092 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 08:55:12,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:55:12,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:55:12,093 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:55:12,093 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:55:12,096 INFO L794 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 6#L-1true havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 16#L1065true assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 15#L1066true entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 8#L1073true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 18#L1076true entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 7#L1470true assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 27#L1471-3true [2018-12-08 08:55:12,096 INFO L796 eck$LassoCheckResult]: Loop: 27#L1471-3true assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 21#L1471-2true entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 27#L1471-3true [2018-12-08 08:55:12,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:12,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815372, now seen corresponding path program 1 times [2018-12-08 08:55:12,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:12,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:12,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:12,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:12,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:55:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:55:12,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:55:12,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:55:12,207 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:55:12,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:12,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 1 times [2018-12-08 08:55:12,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:12,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:12,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:12,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:12,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:12,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 08:55:12,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:55:12,287 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 4 states. [2018-12-08 08:55:12,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:55:12,324 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2018-12-08 08:55:12,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:55:12,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 56 transitions. [2018-12-08 08:55:12,327 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 19 [2018-12-08 08:55:12,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 35 states and 44 transitions. [2018-12-08 08:55:12,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-12-08 08:55:12,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-12-08 08:55:12,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2018-12-08 08:55:12,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:55:12,331 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2018-12-08 08:55:12,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2018-12-08 08:55:12,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2018-12-08 08:55:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-08 08:55:12,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-12-08 08:55:12,349 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-08 08:55:12,349 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-08 08:55:12,350 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 08:55:12,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-12-08 08:55:12,350 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 08:55:12,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:55:12,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:55:12,351 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:55:12,351 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:55:12,351 INFO L794 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 94#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 95#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 90#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 91#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 96#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 97#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 101#L1471-3 [2018-12-08 08:55:12,351 INFO L796 eck$LassoCheckResult]: Loop: 101#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 102#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 101#L1471-3 [2018-12-08 08:55:12,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:12,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1806813450, now seen corresponding path program 1 times [2018-12-08 08:55:12,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:12,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:12,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:12,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:12,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:12,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:12,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 2 times [2018-12-08 08:55:12,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:12,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:12,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:12,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:12,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:12,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:12,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1180938732, now seen corresponding path program 1 times [2018-12-08 08:55:12,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:12,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:12,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:12,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:55:12,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:12,567 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2018-12-08 08:55:12,620 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:55:12,620 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:55:12,620 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:55:12,621 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:55:12,621 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:55:12,621 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:55:12,621 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:55:12,621 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:55:12,621 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-12-08 08:55:12,621 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:55:12,621 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:55:12,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:12,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:12,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:12,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:12,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:12,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:12,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:12,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:12,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:12,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:12,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:12,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:12,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:12,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:12,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:12,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:13,050 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:55:13,053 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:55:13,055 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-12-08 08:55:13,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:13,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:13,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:13,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:13,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:13,059 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-12-08 08:55:13,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:13,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:13,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:13,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:13,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:55:13,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:13,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:13,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:13,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:13,067 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-12-08 08:55:13,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:13,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:13,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:13,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:13,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:13,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:55:13,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:13,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:13,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:13,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:13,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:55:13,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:13,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:13,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:13,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:13,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:13,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:55:13,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:13,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:13,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:13,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:13,083 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-12-08 08:55:13,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:13,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:13,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:13,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:13,088 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-12-08 08:55:13,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:13,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:13,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:13,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:13,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:13,091 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-12-08 08:55:13,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:13,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:13,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:13,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:13,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:55:13,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:13,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:13,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:13,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:13,101 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-12-08 08:55:13,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:13,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:13,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:13,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:13,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:55:13,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:13,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:13,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:13,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:13,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:13,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:55:13,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:13,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:13,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:13,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:13,114 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-12-08 08:55:13,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,114 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:55:13,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,116 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:55:13,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:13,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:13,128 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-12-08 08:55:13,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:13,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:13,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:13,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:13,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:55:13,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:13,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:13,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:13,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:13,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:13,134 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-12-08 08:55:13,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:13,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:13,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:13,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:13,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:13,137 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-12-08 08:55:13,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:13,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:13,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:13,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:13,142 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-12-08 08:55:13,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:13,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:13,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:13,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:13,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:13,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:13,172 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:55:13,200 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-08 08:55:13,200 INFO L444 ModelExtractionUtils]: 31 out of 43 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-12-08 08:55:13,201 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:55:13,202 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:55:13,203 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:55:13,203 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_entry_point_~array~0.base)_1, ULTIMATE.start_entry_point_~array~0.offset, ULTIMATE.start_entry_point_~i~2) = 1*v_rep(select #length ULTIMATE.start_entry_point_~array~0.base)_1 - 1*ULTIMATE.start_entry_point_~array~0.offset - 4*ULTIMATE.start_entry_point_~i~2 Supporting invariants [] [2018-12-08 08:55:13,222 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-12-08 08:55:13,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 08:55:13,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:55:13,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:55:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:55:13,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:55:13,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:55:13,277 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 08:55:13,277 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-08 08:55:13,336 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 52 states and 69 transitions. Complement of second has 7 states. [2018-12-08 08:55:13,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 08:55:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:55:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-12-08 08:55:13,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-08 08:55:13,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:55:13,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-08 08:55:13,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:55:13,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-08 08:55:13,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:55:13,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 69 transitions. [2018-12-08 08:55:13,341 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2018-12-08 08:55:13,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 37 states and 48 transitions. [2018-12-08 08:55:13,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-12-08 08:55:13,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-12-08 08:55:13,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 48 transitions. [2018-12-08 08:55:13,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:55:13,342 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-12-08 08:55:13,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 48 transitions. [2018-12-08 08:55:13,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2018-12-08 08:55:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-08 08:55:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2018-12-08 08:55:13,343 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-12-08 08:55:13,343 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-12-08 08:55:13,344 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 08:55:13,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2018-12-08 08:55:13,344 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-12-08 08:55:13,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:55:13,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:55:13,344 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:55:13,344 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 08:55:13,344 INFO L794 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 248#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 249#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 244#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 245#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 250#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 251#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 255#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 261#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 240#L1444-3 [2018-12-08 08:55:13,345 INFO L796 eck$LassoCheckResult]: Loop: 240#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 242#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 252#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 253#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 239#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 240#L1444-3 [2018-12-08 08:55:13,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:13,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1180938674, now seen corresponding path program 1 times [2018-12-08 08:55:13,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:13,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:13,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:13,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:13,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:55:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:55:13,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:55:13,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:55:13,377 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:55:13,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:13,377 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 1 times [2018-12-08 08:55:13,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:13,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:13,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:13,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:13,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:13,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:55:13,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:55:13,518 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-12-08 08:55:13,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:55:13,544 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2018-12-08 08:55:13,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:55:13,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2018-12-08 08:55:13,546 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2018-12-08 08:55:13,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 58 transitions. [2018-12-08 08:55:13,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-12-08 08:55:13,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-12-08 08:55:13,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2018-12-08 08:55:13,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:55:13,547 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-12-08 08:55:13,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2018-12-08 08:55:13,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2018-12-08 08:55:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-08 08:55:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-12-08 08:55:13,549 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-12-08 08:55:13,549 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-12-08 08:55:13,549 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 08:55:13,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2018-12-08 08:55:13,550 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-12-08 08:55:13,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:55:13,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:55:13,550 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:55:13,550 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 08:55:13,551 INFO L794 eck$LassoCheckResult]: Stem: 337#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 330#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 331#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 326#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 327#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 344#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 348#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 347#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 345#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 322#L1444-3 [2018-12-08 08:55:13,551 INFO L796 eck$LassoCheckResult]: Loop: 322#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 324#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 335#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 336#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 321#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 322#L1444-3 [2018-12-08 08:55:13,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:13,551 INFO L82 PathProgramCache]: Analyzing trace with hash -594068688, now seen corresponding path program 1 times [2018-12-08 08:55:13,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:13,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:13,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:13,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:13,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:55:13,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:55:13,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:55:13,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:55:13,571 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:55:13,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:13,571 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 2 times [2018-12-08 08:55:13,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:13,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:13,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:13,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:13,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:13,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:55:13,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:55:13,709 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-12-08 08:55:13,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:55:13,732 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-12-08 08:55:13,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:55:13,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2018-12-08 08:55:13,733 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-12-08 08:55:13,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 36 transitions. [2018-12-08 08:55:13,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-08 08:55:13,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-12-08 08:55:13,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2018-12-08 08:55:13,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:55:13,734 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-12-08 08:55:13,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2018-12-08 08:55:13,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-08 08:55:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-08 08:55:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-12-08 08:55:13,735 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-12-08 08:55:13,735 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-12-08 08:55:13,736 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 08:55:13,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2018-12-08 08:55:13,736 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-12-08 08:55:13,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:55:13,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:55:13,736 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:55:13,736 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 08:55:13,737 INFO L794 eck$LassoCheckResult]: Stem: 407#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 401#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 402#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 397#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 398#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 403#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 404#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 408#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 409#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 410#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 414#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 393#L1444-3 [2018-12-08 08:55:13,737 INFO L796 eck$LassoCheckResult]: Loop: 393#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 395#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 405#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 406#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 392#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 393#L1444-3 [2018-12-08 08:55:13,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:13,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1010756116, now seen corresponding path program 1 times [2018-12-08 08:55:13,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:13,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:13,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:13,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:55:13,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:13,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:13,751 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 3 times [2018-12-08 08:55:13,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:13,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:13,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:13,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:13,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:13,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:13,757 INFO L82 PathProgramCache]: Analyzing trace with hash 754630971, now seen corresponding path program 1 times [2018-12-08 08:55:13,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:13,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:13,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:13,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:55:13,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:14,093 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 118 [2018-12-08 08:55:14,171 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:55:14,171 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:55:14,171 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:55:14,171 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:55:14,171 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:55:14,171 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:55:14,171 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:55:14,171 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:55:14,172 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-12-08 08:55:14,172 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:55:14,172 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:55:14,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:14,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:14,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:14,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:14,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:14,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:14,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-12-08 08:55:14,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-12-08 08:55:14,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-12-08 08:55:14,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-12-08 08:55:14,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-12-08 08:55:14,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-12-08 08:55:14,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-12-08 08:55:14,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-12-08 08:55:14,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-12-08 08:55:14,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-12-08 08:55:14,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-12-08 08:55:14,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-12-08 08:55:14,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-12-08 08:55:14,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-12-08 08:55:14,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-12-08 08:55:14,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-12-08 08:55:14,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-12-08 08:55:14,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-12-08 08:55:14,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:14,785 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:55:14,785 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:55:14,785 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-12-08 08:55:14,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:14,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:14,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:14,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:14,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,787 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-12-08 08:55:14,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:14,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:14,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:14,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,789 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-12-08 08:55:14,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:14,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:14,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:14,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:14,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,790 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-12-08 08:55:14,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:14,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:14,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:14,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,792 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-12-08 08:55:14,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:14,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:14,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:14,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,794 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-12-08 08:55:14,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:14,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:14,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:14,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,796 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-12-08 08:55:14,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:14,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:14,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:14,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,799 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-12-08 08:55:14,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:14,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:14,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:14,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,801 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-12-08 08:55:14,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:14,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:14,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:14,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,803 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-12-08 08:55:14,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:14,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:14,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:14,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:14,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,805 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-12-08 08:55:14,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:14,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:14,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:14,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,806 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-12-08 08:55:14,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:14,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:14,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:14,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:14,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,808 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-12-08 08:55:14,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:14,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:14,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:14,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,810 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-12-08 08:55:14,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:14,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:14,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:14,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,812 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-12-08 08:55:14,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:14,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:14,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:14,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:14,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,814 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-12-08 08:55:14,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,814 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:55:14,814 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 08:55:14,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,816 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-08 08:55:14,817 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 08:55:14,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,828 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-12-08 08:55:14,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:14,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:14,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:14,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,830 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-12-08 08:55:14,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:14,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:14,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:14,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,832 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-12-08 08:55:14,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,832 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:55:14,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,833 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:55:14,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:14,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,834 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-12-08 08:55:14,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:14,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:14,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:14,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:14,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:14,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:55:14,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:14,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:14,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:14,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:14,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:14,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:14,858 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:55:14,871 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-08 08:55:14,871 INFO L444 ModelExtractionUtils]: 48 out of 55 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 08:55:14,871 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:55:14,872 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:55:14,872 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:55:14,872 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~i~0, ULTIMATE.start_alloc_17_~len) = -1*ULTIMATE.start_alloc_17_~i~0 + 1*ULTIMATE.start_alloc_17_~len Supporting invariants [] [2018-12-08 08:55:14,895 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-12-08 08:55:14,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:55:14,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:55:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:55:14,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:55:14,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:55:14,930 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 08:55:14,930 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-08 08:55:14,943 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 43 states and 56 transitions. Complement of second has 6 states. [2018-12-08 08:55:14,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 08:55:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:55:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2018-12-08 08:55:14,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 5 letters. [2018-12-08 08:55:14,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:55:14,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 16 letters. Loop has 5 letters. [2018-12-08 08:55:14,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:55:14,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 10 letters. [2018-12-08 08:55:14,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:55:14,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 56 transitions. [2018-12-08 08:55:14,946 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-08 08:55:14,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 31 states and 40 transitions. [2018-12-08 08:55:14,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-08 08:55:14,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-08 08:55:14,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2018-12-08 08:55:14,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:55:14,947 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2018-12-08 08:55:14,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2018-12-08 08:55:14,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-12-08 08:55:14,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-08 08:55:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-12-08 08:55:14,949 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-12-08 08:55:14,949 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-12-08 08:55:14,949 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 08:55:14,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2018-12-08 08:55:14,949 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 08:55:14,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:55:14,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:55:14,950 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:55:14,950 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:55:14,950 INFO L794 eck$LassoCheckResult]: Stem: 585#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 575#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 576#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 573#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 574#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 579#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 580#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 586#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 587#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 588#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 592#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 568#L1444-3 assume !(alloc_17_~i~0 < alloc_17_~len); 569#L1444-4 alloc_17_#res := 0; 572#L1455 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 591#L1460-3 [2018-12-08 08:55:14,950 INFO L796 eck$LassoCheckResult]: Loop: 591#L1460-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 590#L1460-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 591#L1460-3 [2018-12-08 08:55:14,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:14,950 INFO L82 PathProgramCache]: Analyzing trace with hash -580221115, now seen corresponding path program 1 times [2018-12-08 08:55:14,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:14,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:14,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:14,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:14,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:55:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 08:55:14,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:55:14,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:55:14,972 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:55:14,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:14,972 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 1 times [2018-12-08 08:55:14,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:14,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:14,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:14,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:14,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:15,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:55:15,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:55:15,005 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-08 08:55:15,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:55:15,044 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2018-12-08 08:55:15,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:55:15,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 86 transitions. [2018-12-08 08:55:15,044 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2018-12-08 08:55:15,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 86 transitions. [2018-12-08 08:55:15,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-12-08 08:55:15,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-12-08 08:55:15,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 86 transitions. [2018-12-08 08:55:15,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:55:15,045 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 86 transitions. [2018-12-08 08:55:15,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 86 transitions. [2018-12-08 08:55:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2018-12-08 08:55:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-08 08:55:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-12-08 08:55:15,048 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-12-08 08:55:15,048 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-12-08 08:55:15,048 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 08:55:15,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2018-12-08 08:55:15,048 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 08:55:15,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:55:15,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:55:15,049 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:55:15,049 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:55:15,049 INFO L794 eck$LassoCheckResult]: Stem: 693#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 684#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 685#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 680#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 681#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 687#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 688#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 703#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 696#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 697#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 704#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 705#L1444-3 assume !(alloc_17_~i~0 < alloc_17_~len); 678#L1444-4 alloc_17_#res := 0; 679#L1455 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 700#L1460-3 [2018-12-08 08:55:15,049 INFO L796 eck$LassoCheckResult]: Loop: 700#L1460-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 699#L1460-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 700#L1460-3 [2018-12-08 08:55:15,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:15,049 INFO L82 PathProgramCache]: Analyzing trace with hash -838386553, now seen corresponding path program 1 times [2018-12-08 08:55:15,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:15,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:15,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:15,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:55:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 08:55:15,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:55:15,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:55:15,071 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:55:15,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:15,071 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 2 times [2018-12-08 08:55:15,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:15,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:15,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:15,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:15,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:55:15,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:55:15,095 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-12-08 08:55:15,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:55:15,124 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-12-08 08:55:15,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:55:15,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 64 transitions. [2018-12-08 08:55:15,125 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-08 08:55:15,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 64 transitions. [2018-12-08 08:55:15,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-12-08 08:55:15,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-12-08 08:55:15,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 64 transitions. [2018-12-08 08:55:15,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:55:15,126 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 64 transitions. [2018-12-08 08:55:15,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 64 transitions. [2018-12-08 08:55:15,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2018-12-08 08:55:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-08 08:55:15,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-12-08 08:55:15,127 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-08 08:55:15,127 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-08 08:55:15,127 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 08:55:15,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-12-08 08:55:15,127 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 08:55:15,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:55:15,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:55:15,127 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:55:15,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:55:15,128 INFO L794 eck$LassoCheckResult]: Stem: 792#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 784#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 785#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 780#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 781#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 786#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 787#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 793#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 794#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 795#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 799#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 775#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 777#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 788#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 789#L1446 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 800#L1446-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 783#L1451-3 [2018-12-08 08:55:15,128 INFO L796 eck$LassoCheckResult]: Loop: 783#L1451-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 782#L1451-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 783#L1451-3 [2018-12-08 08:55:15,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:15,128 INFO L82 PathProgramCache]: Analyzing trace with hash 754690497, now seen corresponding path program 1 times [2018-12-08 08:55:15,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:15,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:15,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:55:15,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:15,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:15,137 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 1 times [2018-12-08 08:55:15,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:15,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:15,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:15,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:15,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:15,141 INFO L82 PathProgramCache]: Analyzing trace with hash -591903197, now seen corresponding path program 1 times [2018-12-08 08:55:15,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:15,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:15,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:15,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:55:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 08:55:15,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:55:15,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 08:55:15,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 08:55:15,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:55:15,230 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-08 08:55:15,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:55:15,303 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2018-12-08 08:55:15,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 08:55:15,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 87 transitions. [2018-12-08 08:55:15,304 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2018-12-08 08:55:15,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 87 transitions. [2018-12-08 08:55:15,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-12-08 08:55:15,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-12-08 08:55:15,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 87 transitions. [2018-12-08 08:55:15,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:55:15,305 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 87 transitions. [2018-12-08 08:55:15,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 87 transitions. [2018-12-08 08:55:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 47. [2018-12-08 08:55:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-08 08:55:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2018-12-08 08:55:15,306 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2018-12-08 08:55:15,306 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2018-12-08 08:55:15,306 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-08 08:55:15,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 61 transitions. [2018-12-08 08:55:15,307 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 08:55:15,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:55:15,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:55:15,307 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:55:15,307 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:55:15,307 INFO L794 eck$LassoCheckResult]: Stem: 916#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 905#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 906#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 907#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 925#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 926#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 917#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 918#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 930#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 928#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 929#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 896#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 897#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 914#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 915#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 894#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 895#L1444-3 assume !(alloc_17_~i~0 < alloc_17_~len); 900#L1444-4 alloc_17_#res := 0; 902#L1455 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 924#L1460-3 [2018-12-08 08:55:15,307 INFO L796 eck$LassoCheckResult]: Loop: 924#L1460-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 923#L1460-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 924#L1460-3 [2018-12-08 08:55:15,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:15,307 INFO L82 PathProgramCache]: Analyzing trace with hash 420857150, now seen corresponding path program 1 times [2018-12-08 08:55:15,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:15,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:15,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:15,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:55:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 08:55:15,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:55:15,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 08:55:15,323 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:55:15,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:15,323 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 3 times [2018-12-08 08:55:15,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:15,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:15,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:15,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:15,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 08:55:15,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:55:15,344 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-12-08 08:55:15,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:55:15,358 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2018-12-08 08:55:15,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:55:15,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 80 transitions. [2018-12-08 08:55:15,359 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-12-08 08:55:15,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 63 states and 76 transitions. [2018-12-08 08:55:15,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-12-08 08:55:15,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-12-08 08:55:15,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 76 transitions. [2018-12-08 08:55:15,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:55:15,360 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 76 transitions. [2018-12-08 08:55:15,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 76 transitions. [2018-12-08 08:55:15,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2018-12-08 08:55:15,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-08 08:55:15,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2018-12-08 08:55:15,361 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2018-12-08 08:55:15,361 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2018-12-08 08:55:15,361 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-08 08:55:15,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2018-12-08 08:55:15,362 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 08:55:15,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:55:15,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:55:15,362 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:55:15,362 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:55:15,362 INFO L794 eck$LassoCheckResult]: Stem: 1038#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1027#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1028#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1025#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1026#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1032#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1033#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1063#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1051#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1049#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1050#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1019#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1020#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1062#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1061#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1060#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1059#L1444-3 assume !(alloc_17_~i~0 < alloc_17_~len); 1022#L1444-4 alloc_17_#res := 0; 1024#L1455 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 1046#L1460-3 [2018-12-08 08:55:15,362 INFO L796 eck$LassoCheckResult]: Loop: 1046#L1460-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 1045#L1460-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 1046#L1460-3 [2018-12-08 08:55:15,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:15,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1354150212, now seen corresponding path program 1 times [2018-12-08 08:55:15,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:15,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:15,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:55:15,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:15,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:15,374 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 4 times [2018-12-08 08:55:15,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:15,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:15,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:15,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:15,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:15,378 INFO L82 PathProgramCache]: Analyzing trace with hash 36739678, now seen corresponding path program 1 times [2018-12-08 08:55:15,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:15,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:15,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:55:15,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:16,226 WARN L180 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 184 [2018-12-08 08:55:16,238 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:55:16,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:55:16,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:55:16,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:289, output treesize:290 [2018-12-08 08:55:16,603 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-12-08 08:55:16,606 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:55:16,606 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:55:16,606 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:55:16,606 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:55:16,606 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:55:16,606 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:55:16,606 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:55:16,606 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:55:16,606 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2_true-valid-memsafety_true-termination.i_Iteration10_Lasso [2018-12-08 08:55:16,606 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:55:16,606 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:55:16,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:16,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-12-08 08:55:16,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:16,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:16,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-12-08 08:55:16,942 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 104 [2018-12-08 08:55:17,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:17,373 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:55:17,373 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:55:17,373 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-12-08 08:55:17,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:17,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:17,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:17,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:17,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:17,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:17,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:17,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:17,375 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-12-08 08:55:17,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:17,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:17,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:17,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:17,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:17,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:17,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:17,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:55:17,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:17,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:17,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:17,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:17,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:17,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:17,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:17,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:17,379 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-12-08 08:55:17,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:17,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:17,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:17,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:17,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:17,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:17,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:17,380 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-12-08 08:55:17,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:17,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:17,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:17,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:17,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:17,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:17,398 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:55:17,408 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 08:55:17,408 INFO L444 ModelExtractionUtils]: 45 out of 55 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-08 08:55:17,408 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:55:17,409 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:55:17,409 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:55:17,409 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_free_17_~i~1, v_rep(select #length ULTIMATE.start_free_17_~array.base)_1, ULTIMATE.start_free_17_~array.offset) = -4*ULTIMATE.start_free_17_~i~1 + 1*v_rep(select #length ULTIMATE.start_free_17_~array.base)_1 - 1*ULTIMATE.start_free_17_~array.offset Supporting invariants [] [2018-12-08 08:55:17,466 INFO L297 tatePredicateManager]: 19 out of 19 supporting invariants were superfluous and have been removed [2018-12-08 08:55:17,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 08:55:17,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:55:17,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:55:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:55:17,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:55:17,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:55:17,501 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 08:55:17,501 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 59 transitions. cyclomatic complexity: 18 Second operand 3 states. [2018-12-08 08:55:17,507 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 59 transitions. cyclomatic complexity: 18. Second operand 3 states. Result 49 states and 62 transitions. Complement of second has 4 states. [2018-12-08 08:55:17,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 08:55:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:55:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2018-12-08 08:55:17,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 19 letters. Loop has 2 letters. [2018-12-08 08:55:17,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:55:17,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 21 letters. Loop has 2 letters. [2018-12-08 08:55:17,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:55:17,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 19 letters. Loop has 4 letters. [2018-12-08 08:55:17,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:55:17,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 62 transitions. [2018-12-08 08:55:17,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:55:17,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 23 states and 26 transitions. [2018-12-08 08:55:17,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-08 08:55:17,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-08 08:55:17,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2018-12-08 08:55:17,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:55:17,509 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-08 08:55:17,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2018-12-08 08:55:17,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-08 08:55:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-08 08:55:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-12-08 08:55:17,510 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-08 08:55:17,510 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-08 08:55:17,510 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-08 08:55:17,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2018-12-08 08:55:17,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:55:17,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:55:17,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:55:17,511 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:55:17,511 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:55:17,511 INFO L794 eck$LassoCheckResult]: Stem: 1289#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1279#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1280#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1277#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1278#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1283#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1284#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1290#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1291#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1292#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1293#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1274#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1275#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1287#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1288#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1272#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1273#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1276#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1285#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1286#L1446 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1294#L1446-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1282#L1451-3 [2018-12-08 08:55:17,511 INFO L796 eck$LassoCheckResult]: Loop: 1282#L1451-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1281#L1451-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1282#L1451-3 [2018-12-08 08:55:17,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:17,511 INFO L82 PathProgramCache]: Analyzing trace with hash 38170488, now seen corresponding path program 1 times [2018-12-08 08:55:17,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:17,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:17,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:17,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:17,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:55:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:55:17,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:55:17,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33e7efe3-fb9f-4ed0-a737-6211621b8a07/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:55:17,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:55:17,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:55:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:55:17,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:55:17,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2018-12-08 08:55:17,639 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:55:17,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:17,639 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 2 times [2018-12-08 08:55:17,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:17,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:17,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:17,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:55:17,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:17,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-08 08:55:17,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-08 08:55:17,690 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. cyclomatic complexity: 6 Second operand 15 states. [2018-12-08 08:55:17,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:55:17,803 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-12-08 08:55:17,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 08:55:17,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2018-12-08 08:55:17,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:55:17,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 26 states and 29 transitions. [2018-12-08 08:55:17,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-08 08:55:17,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-08 08:55:17,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2018-12-08 08:55:17,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:55:17,804 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-12-08 08:55:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2018-12-08 08:55:17,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-08 08:55:17,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-08 08:55:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-12-08 08:55:17,805 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-12-08 08:55:17,805 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-12-08 08:55:17,805 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-08 08:55:17,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2018-12-08 08:55:17,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:55:17,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:55:17,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:55:17,806 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:55:17,806 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:55:17,806 INFO L794 eck$LassoCheckResult]: Stem: 1438#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1430#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1431#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1426#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1427#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1432#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1433#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1439#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1440#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1441#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1442#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1445#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1443#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1423#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1424#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1436#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1437#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1421#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1422#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1425#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1434#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1435#L1446 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1444#L1446-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1429#L1451-3 [2018-12-08 08:55:17,806 INFO L796 eck$LassoCheckResult]: Loop: 1429#L1451-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1428#L1451-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1429#L1451-3 [2018-12-08 08:55:17,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:17,807 INFO L82 PathProgramCache]: Analyzing trace with hash -2124874406, now seen corresponding path program 2 times [2018-12-08 08:55:17,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:17,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:17,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:17,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:55:17,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:17,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:17,820 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 3 times [2018-12-08 08:55:17,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:17,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:17,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:17,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:55:17,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:17,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:17,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1894836356, now seen corresponding path program 1 times [2018-12-08 08:55:17,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:55:17,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:55:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:17,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:55:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:55:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:55:19,051 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 241 DAG size of output: 207 [2018-12-08 08:55:19,056 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:55:19,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:55:19,262 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:55:19,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:55:19,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 08:55:19,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:306, output treesize:298 [2018-12-08 08:55:19,599 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-12-08 08:55:19,601 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:55:19,601 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:55:19,601 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:55:19,601 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:55:19,601 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:55:19,602 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:55:19,602 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:55:19,602 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:55:19,602 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2_true-valid-memsafety_true-termination.i_Iteration12_Lasso [2018-12-08 08:55:19,602 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:55:19,602 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:55:19,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,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-12-08 08:55:19,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-12-08 08:55:19,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-12-08 08:55:19,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-12-08 08:55:19,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-12-08 08:55:19,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-12-08 08:55:19,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-12-08 08:55:19,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:19,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:55:20,141 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:55:20,141 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:55:20,141 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-12-08 08:55:20,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:20,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:20,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:20,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:20,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:20,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:20,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:20,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:20,143 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-12-08 08:55:20,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:20,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:20,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:20,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:20,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:20,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:20,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:20,145 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-12-08 08:55:20,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:20,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:20,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:20,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:20,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:20,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:20,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:20,147 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-12-08 08:55:20,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:20,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:20,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:20,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:20,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:20,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:20,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:20,148 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-12-08 08:55:20,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:20,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:20,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:20,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:20,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:20,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:20,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:20,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:20,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:55:20,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:20,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:20,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:20,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:20,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:20,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:20,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:20,151 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-12-08 08:55:20,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:20,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:20,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:20,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:20,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:20,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:20,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:20,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:20,152 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-12-08 08:55:20,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:20,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:20,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:20,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:20,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:20,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:20,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:20,153 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-12-08 08:55:20,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:20,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:20,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:20,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:20,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:20,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:20,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:20,155 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-12-08 08:55:20,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:20,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:20,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:20,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:20,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:20,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:20,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:20,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:20,156 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-12-08 08:55:20,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:20,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:20,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:20,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:20,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:20,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:20,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:20,157 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-12-08 08:55:20,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:20,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:20,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:20,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:20,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:20,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:20,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:20,159 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-12-08 08:55:20,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:20,159 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:55:20,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:20,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:20,160 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:55:20,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:20,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:20,161 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-12-08 08:55:20,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:20,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:20,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:20,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:20,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:20,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:20,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:20,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:20,162 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-12-08 08:55:20,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:20,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:55:20,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:20,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:20,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:20,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:55:20,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:55:20,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:20,163 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-12-08 08:55:20,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:20,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:20,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:20,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:20,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:20,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:20,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:20,166 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-12-08 08:55:20,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:20,166 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:55:20,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:20,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:20,167 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:55:20,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:20,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:55:20,168 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-12-08 08:55:20,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:55:20,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:55:20,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:55:20,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:55:20,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:55:20,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:55:20,178 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:55:20,187 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 08:55:20,188 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 08:55:20,188 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:55:20,189 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:55:20,189 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:55:20,189 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~j~0) = 2*ULTIMATE.start_alloc_17_~j~0 + 1 Supporting invariants [] [2018-12-08 08:55:20,209 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-12-08 08:55:20,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:55:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:55:20,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:55:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:55:20,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:55:20,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:55:20,247 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 08:55:20,247 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-08 08:55:20,252 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 27 states and 31 transitions. Complement of second has 4 states. [2018-12-08 08:55:20,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 08:55:20,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:55:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-12-08 08:55:20,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 23 letters. Loop has 2 letters. [2018-12-08 08:55:20,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:55:20,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 25 letters. Loop has 2 letters. [2018-12-08 08:55:20,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:55:20,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 23 letters. Loop has 4 letters. [2018-12-08 08:55:20,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:55:20,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2018-12-08 08:55:20,254 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 08:55:20,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2018-12-08 08:55:20,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 08:55:20,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 08:55:20,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 08:55:20,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:55:20,254 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:55:20,254 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:55:20,254 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:55:20,254 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-08 08:55:20,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 08:55:20,255 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 08:55:20,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 08:55:20,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 08:55:20 BoogieIcfgContainer [2018-12-08 08:55:20,259 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 08:55:20,260 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 08:55:20,260 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 08:55:20,260 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 08:55:20,260 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:55:12" (3/4) ... [2018-12-08 08:55:20,262 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 08:55:20,263 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 08:55:20,263 INFO L168 Benchmark]: Toolchain (without parser) took 8850.16 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 382.7 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -100.2 MB). Peak memory consumption was 282.5 MB. Max. memory is 11.5 GB. [2018-12-08 08:55:20,264 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:55:20,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2018-12-08 08:55:20,264 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:55:20,265 INFO L168 Benchmark]: Boogie Preprocessor took 17.59 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-08 08:55:20,265 INFO L168 Benchmark]: RCFGBuilder took 204.97 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: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-12-08 08:55:20,265 INFO L168 Benchmark]: BuchiAutomizer took 8232.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 249.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 269.9 MB. Max. memory is 11.5 GB. [2018-12-08 08:55:20,266 INFO L168 Benchmark]: Witness Printer took 2.99 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:55:20,268 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 355.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.59 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 204.97 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: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8232.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 249.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 269.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.99 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (8 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[array] + -1 * array + -4 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + len and consists of 4 locations. One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[array] + -1 * array and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 8 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 7.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 145 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 47 states and ocurred in iteration 8. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 376 SDtfs, 525 SDslu, 580 SDs, 0 SdLazy, 323 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU7 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital314 mio100 ax110 hnf100 lsp85 ukn59 mio100 lsp54 div100 bol100 ite100 ukn100 eq191 hnf88 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 5 VariablesLoop: 5 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...