./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8f71684a-1f63-4523-9099-4ce23e072ec8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8f71684a-1f63-4523-9099-4ce23e072ec8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8f71684a-1f63-4523-9099-4ce23e072ec8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8f71684a-1f63-4523-9099-4ce23e072ec8/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8f71684a-1f63-4523-9099-4ce23e072ec8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8f71684a-1f63-4523-9099-4ce23e072ec8/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 12e277c835ccbb2e237f5234b2aa8358e814750b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 12:38:12,059 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:38:12,060 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:38:12,067 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:38:12,067 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:38:12,068 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:38:12,068 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:38:12,070 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:38:12,071 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:38:12,071 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:38:12,072 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:38:12,072 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:38:12,072 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:38:12,073 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:38:12,074 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:38:12,074 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:38:12,075 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:38:12,076 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:38:12,077 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:38:12,078 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:38:12,079 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:38:12,080 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:38:12,082 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:38:12,082 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:38:12,082 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:38:12,083 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:38:12,083 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:38:12,084 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:38:12,084 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:38:12,085 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:38:12,085 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:38:12,086 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:38:12,086 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:38:12,086 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:38:12,087 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:38:12,087 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:38:12,088 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8f71684a-1f63-4523-9099-4ce23e072ec8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 12:38:12,098 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:38:12,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:38:12,099 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:38:12,100 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:38:12,100 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:38:12,100 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 12:38:12,100 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 12:38:12,100 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 12:38:12,100 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 12:38:12,101 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 12:38:12,101 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 12:38:12,101 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:38:12,101 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:38:12,101 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 12:38:12,101 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:38:12,101 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:38:12,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:38:12,102 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 12:38:12,102 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 12:38:12,102 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 12:38:12,102 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:38:12,102 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:38:12,102 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 12:38:12,103 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:38:12,103 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 12:38:12,103 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:38:12,103 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:38:12,103 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 12:38:12,103 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:38:12,103 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:38:12,104 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 12:38:12,104 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 12:38:12,104 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_8f71684a-1f63-4523-9099-4ce23e072ec8/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 -> 12e277c835ccbb2e237f5234b2aa8358e814750b [2018-11-23 12:38:12,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:38:12,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:38:12,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:38:12,137 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:38:12,137 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:38:12,138 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8f71684a-1f63-4523-9099-4ce23e072ec8/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-11-23 12:38:12,173 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8f71684a-1f63-4523-9099-4ce23e072ec8/bin-2019/uautomizer/data/f05263c41/e78fb5f6a4e748b99b3927d511ec4b4d/FLAG0e5ed75e8 [2018-11-23 12:38:12,618 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:38:12,619 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8f71684a-1f63-4523-9099-4ce23e072ec8/sv-benchmarks/c/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-11-23 12:38:12,629 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8f71684a-1f63-4523-9099-4ce23e072ec8/bin-2019/uautomizer/data/f05263c41/e78fb5f6a4e748b99b3927d511ec4b4d/FLAG0e5ed75e8 [2018-11-23 12:38:12,638 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8f71684a-1f63-4523-9099-4ce23e072ec8/bin-2019/uautomizer/data/f05263c41/e78fb5f6a4e748b99b3927d511ec4b4d [2018-11-23 12:38:12,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:38:12,641 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:38:12,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:38:12,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:38:12,645 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:38:12,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:38:12" (1/1) ... [2018-11-23 12:38:12,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24af9bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:38:12, skipping insertion in model container [2018-11-23 12:38:12,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:38:12" (1/1) ... [2018-11-23 12:38:12,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:38:12,692 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:38:12,988 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:38:12,999 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:38:13,044 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:38:13,084 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:38:13,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:38:13 WrapperNode [2018-11-23 12:38:13,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:38:13,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:38:13,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:38:13,086 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:38:13,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:38:13" (1/1) ... [2018-11-23 12:38:13,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:38:13" (1/1) ... [2018-11-23 12:38:13,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:38:13,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:38:13,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:38:13,116 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:38:13,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:38:13" (1/1) ... [2018-11-23 12:38:13,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:38:13" (1/1) ... [2018-11-23 12:38:13,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:38:13" (1/1) ... [2018-11-23 12:38:13,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:38:13" (1/1) ... [2018-11-23 12:38:13,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:38:13" (1/1) ... [2018-11-23 12:38:13,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:38:13" (1/1) ... [2018-11-23 12:38:13,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:38:13" (1/1) ... [2018-11-23 12:38:13,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:38:13,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:38:13,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:38:13,135 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:38:13,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:38:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f71684a-1f63-4523-9099-4ce23e072ec8/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:38:13,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:38:13,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:38:13,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:38:13,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:38:13,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 12:38:13,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:38:13,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:38:13,327 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:38:13,328 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 12:38:13,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:38:13 BoogieIcfgContainer [2018-11-23 12:38:13,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:38:13,329 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 12:38:13,329 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 12:38:13,332 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 12:38:13,332 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:38:13,332 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 12:38:12" (1/3) ... [2018-11-23 12:38:13,333 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f70c376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:38:13, skipping insertion in model container [2018-11-23 12:38:13,333 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:38:13,333 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:38:13" (2/3) ... [2018-11-23 12:38:13,334 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f70c376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:38:13, skipping insertion in model container [2018-11-23 12:38:13,334 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:38:13,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:38:13" (3/3) ... [2018-11-23 12:38:13,335 INFO L375 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-11-23 12:38:13,372 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:38:13,372 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 12:38:13,372 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 12:38:13,372 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 12:38:13,372 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:38:13,372 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:38:13,373 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 12:38:13,373 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:38:13,373 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 12:38:13,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-23 12:38:13,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 12:38:13,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:38:13,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:38:13,405 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 12:38:13,406 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 12:38:13,406 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 12:38:13,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-23 12:38:13,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 12:38:13,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:38:13,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:38:13,407 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 12:38:13,407 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 12:38:13,410 INFO L794 eck$LassoCheckResult]: Stem: 12#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); 8#L-1true havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;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; 14#L1073true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 10#L1076true entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 3#L1444true assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 5#L1445-3true [2018-11-23 12:38:13,411 INFO L796 eck$LassoCheckResult]: Loop: 5#L1445-3true assume !!(entry_point_~i~0 < entry_point_~len~0);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; 18#L1073-1true 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; 11#L1076-1true entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 13#L1447true assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 4#L1445-2true entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 5#L1445-3true [2018-11-23 12:38:13,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:38:13,414 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-23 12:38:13,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:38:13,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:38:13,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:13,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:38:13,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:38:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:38:13,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:38:13,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:38:13,534 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 12:38:13,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:38:13,534 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 1 times [2018-11-23 12:38:13,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:38:13,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:38:13,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:13,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:38:13,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:13,708 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-23 12:38:13,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:38:13,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:38:13,770 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2018-11-23 12:38:13,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:38:13,829 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-23 12:38:13,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:38:13,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2018-11-23 12:38:13,833 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-23 12:38:13,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 20 states and 23 transitions. [2018-11-23 12:38:13,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 12:38:13,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 12:38:13,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-23 12:38:13,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:38:13,838 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 12:38:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-23 12:38:13,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2018-11-23 12:38:13,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:38:13,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-11-23 12:38:13,855 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-23 12:38:13,855 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-23 12:38:13,855 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 12:38:13,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-11-23 12:38:13,856 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 12:38:13,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:38:13,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:38:13,856 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 12:38:13,857 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 12:38:13,857 INFO L794 eck$LassoCheckResult]: Stem: 71#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); 66#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;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; 67#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; 68#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 60#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 61#L1445-3 [2018-11-23 12:38:13,857 INFO L796 eck$LassoCheckResult]: Loop: 61#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);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; 63#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; 69#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 70#L1447 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 62#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 61#L1445-3 [2018-11-23 12:38:13,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:38:13,857 INFO L82 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2018-11-23 12:38:13,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:38:13,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:38:13,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:13,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:38:13,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:13,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:38:13,875 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 2 times [2018-11-23 12:38:13,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:38:13,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:38:13,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:13,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:38:13,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:13,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:38:13,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1173278059, now seen corresponding path program 1 times [2018-11-23 12:38:13,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:38:13,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:38:13,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:13,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:38:13,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:14,048 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-23 12:38:14,210 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2018-11-23 12:38:14,270 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:38:14,271 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:38:14,271 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:38:14,272 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:38:14,272 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:38:14,272 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:38:14,272 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:38:14,272 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:38:14,272 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_2_false-valid-memtrack_true-termination.i_Iteration2_Lasso [2018-11-23 12:38:14,272 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:38:14,273 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:38:14,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:14,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:14,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:14,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:14,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:14,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:14,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:14,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:14,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:14,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:14,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:14,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:14,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:14,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:14,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:14,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:14,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:14,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:14,812 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:38:14,815 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:38:14,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:14,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:14,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:38:14,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:14,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:14,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:14,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:38:14,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:14,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:38:14,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:38:14,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38: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-11-23 12:38:14,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:38:14,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:14,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:38:14,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:38:14,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38: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-11-23 12:38:14,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:38:14,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:14,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:38:14,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:38:14,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38: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-11-23 12:38:14,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:14,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:38:14,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:14,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:14,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:14,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:38:14,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:14,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:38:14,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:38:14,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:14,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:14,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:38:14,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:14,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:38:14,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:38:14,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:14,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:14,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:38:14,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:14,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:38:14,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:38:14,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:14,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:14,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:14,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:38:14,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:14,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:14,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:14,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:14,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:38:14,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:14,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:14,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:14,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:38:14,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:14,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:38:14,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:38:14,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:14,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:14,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:38:14,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:14,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:38:14,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:38:14,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:14,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:14,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:14,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:38:14,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:14,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:14,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:14,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:38:14,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:14,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:38:14,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:38:14,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:14,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:14,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:14,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:38:14,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:14,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:14,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:14,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:38:14,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:14,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:38:14,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:38:14,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:14,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:14,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:14,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,894 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:38:14,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:14,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:14,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:14,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,901 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:38:14,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,903 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:38:14,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:14,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:14,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:14,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:14,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:38:14,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:14,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:14,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:14,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:14,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:14,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:14,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:14,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:38:14,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:14,970 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:38:15,007 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 12:38:15,008 INFO L444 ModelExtractionUtils]: 35 out of 43 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 12:38:15,010 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:38:15,011 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 12:38:15,011 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:38:15,012 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0, ULTIMATE.start_entry_point_~i~0) = 1*ULTIMATE.start_entry_point_~len~0 - 1*ULTIMATE.start_entry_point_~i~0 Supporting invariants [] [2018-11-23 12:38:15,035 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-23 12:38:15,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:38:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:38:15,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:38:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:38:15,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:38:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:38:15,083 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-11-23 12:38:15,084 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-23 12:38:15,118 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 21 states and 26 transitions. Complement of second has 4 states. [2018-11-23 12:38:15,118 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-11-23 12:38:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:38:15,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-11-23 12:38:15,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-23 12:38:15,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:38:15,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-23 12:38:15,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:38:15,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-23 12:38:15,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:38:15,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2018-11-23 12:38:15,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 12:38:15,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 21 transitions. [2018-11-23 12:38:15,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 12:38:15,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 12:38:15,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2018-11-23 12:38:15,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:38:15,123 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-23 12:38:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2018-11-23 12:38:15,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 12:38:15,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:38:15,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-23 12:38:15,125 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-23 12:38:15,125 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-23 12:38:15,125 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 12:38:15,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-23 12:38:15,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 12:38:15,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:38:15,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:38:15,126 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:38:15,126 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 12:38:15,126 INFO L794 eck$LassoCheckResult]: Stem: 179#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); 172#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;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; 173#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; 174#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 164#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 165#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);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; 169#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 175#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 176#L1447 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 180#L1447-1 entry_point_~j~0 := entry_point_~i~0 - 1; 171#L1453-3 [2018-11-23 12:38:15,127 INFO L796 eck$LassoCheckResult]: Loop: 171#L1453-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 170#L1453-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 171#L1453-3 [2018-11-23 12:38:15,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:38:15,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1173218534, now seen corresponding path program 1 times [2018-11-23 12:38:15,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:38:15,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:38:15,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:15,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:38:15,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:15,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:38:15,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 1 times [2018-11-23 12:38:15,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:38:15,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:38:15,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:15,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:38:15,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:15,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:38:15,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2113389244, now seen corresponding path program 1 times [2018-11-23 12:38:15,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:38:15,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:38:15,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:15,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:38:15,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:38:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:38:15,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:38:15,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:38:15,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:38:15,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:38:15,197 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-23 12:38:15,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:38:15,217 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-23 12:38:15,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:38:15,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-11-23 12:38:15,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 12:38:15,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 25 transitions. [2018-11-23 12:38:15,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 12:38:15,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 12:38:15,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2018-11-23 12:38:15,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:38:15,219 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-23 12:38:15,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2018-11-23 12:38:15,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-11-23 12:38:15,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:38:15,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-23 12:38:15,220 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-23 12:38:15,220 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-23 12:38:15,220 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 12:38:15,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-23 12:38:15,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 12:38:15,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:38:15,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:38:15,221 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:38:15,221 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 12:38:15,221 INFO L794 eck$LassoCheckResult]: Stem: 233#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); 226#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;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; 227#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; 228#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 218#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 219#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);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; 222#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 231#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 232#L1447 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 220#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 221#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);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; 223#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 229#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 230#L1447 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 234#L1447-1 entry_point_~j~0 := entry_point_~i~0 - 1; 225#L1453-3 [2018-11-23 12:38:15,221 INFO L796 eck$LassoCheckResult]: Loop: 225#L1453-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 224#L1453-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 225#L1453-3 [2018-11-23 12:38:15,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:38:15,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1659616398, now seen corresponding path program 1 times [2018-11-23 12:38:15,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:38:15,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:38:15,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:15,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:38:15,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:38:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:38:15,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:38:15,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:38:15,251 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 12:38:15,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:38:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 2 times [2018-11-23 12:38:15,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:38:15,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:38:15,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:15,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:38:15,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:15,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:38:15,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:38:15,290 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-23 12:38:15,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:38:15,322 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 12:38:15,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:38:15,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2018-11-23 12:38:15,323 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 12:38:15,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 24 transitions. [2018-11-23 12:38:15,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 12:38:15,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 12:38:15,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2018-11-23 12:38:15,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:38:15,324 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 12:38:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2018-11-23 12:38:15,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-11-23 12:38:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:38:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-23 12:38:15,325 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 12:38:15,325 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 12:38:15,325 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 12:38:15,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-23 12:38:15,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 12:38:15,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:38:15,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:38:15,326 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:38:15,326 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 12:38:15,326 INFO L794 eck$LassoCheckResult]: Stem: 283#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); 276#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;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; 277#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; 278#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 268#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 269#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);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; 272#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; 281#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 282#L1447 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 270#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 271#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);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; 273#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 279#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 280#L1447 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 284#L1447-1 entry_point_~j~0 := entry_point_~i~0 - 1; 275#L1453-3 [2018-11-23 12:38:15,327 INFO L796 eck$LassoCheckResult]: Loop: 275#L1453-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 274#L1453-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 275#L1453-3 [2018-11-23 12:38:15,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:38:15,327 INFO L82 PathProgramCache]: Analyzing trace with hash 979558028, now seen corresponding path program 1 times [2018-11-23 12:38:15,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:38:15,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:38:15,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:15,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:38:15,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:15,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:38:15,343 INFO L82 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 3 times [2018-11-23 12:38:15,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:38:15,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:38:15,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:15,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:38:15,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:15,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:38:15,349 INFO L82 PathProgramCache]: Analyzing trace with hash 757428654, now seen corresponding path program 1 times [2018-11-23 12:38:15,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:38:15,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:38:15,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:15,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:38:15,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:38:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:38:15,735 WARN L180 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 141 [2018-11-23 12:38:15,816 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:38:15,816 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:38:15,816 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:38:15,816 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:38:15,816 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:38:15,816 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:38:15,816 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:38:15,816 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:38:15,816 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_2_false-valid-memtrack_true-termination.i_Iteration5_Lasso [2018-11-23 12:38:15,816 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:38:15,816 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:38:15,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:15,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:38:16,116 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:38:16,116 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:38:16,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:16,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:16,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:38:16,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:16,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:16,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:16,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:38:16,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:38:16,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:16,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:16,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:16,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:16,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:16,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:16,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:38:16,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:16,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:16,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:16,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:16,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:16,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:16,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:16,123 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:38:16,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:16,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:16,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:16,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:16,126 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:38:16,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:16,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:16,127 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:38:16,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:16,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:16,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:16,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:16,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:38:16,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:16,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:16,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:16,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:38:16,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:38:16,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:16,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:16,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:16,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:16,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:16,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:16,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:38:16,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:16,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:16,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:16,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:16,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:38:16,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:16,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:16,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:16,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:38:16,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:38:16,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:16,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:16,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:16,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:38:16,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:16,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:16,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:16,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:38:16,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:38:16,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:16,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:16,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:16,137 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:38:16,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:16,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:16,138 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:38:16,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:16,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:16,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-11-23 12:38:16,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:16,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:38:16,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:16,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:16,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:16,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:38:16,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:38:16,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:16,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:16,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:16,144 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:38:16,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:16,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:16,145 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:38:16,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:16,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:16,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-11-23 12:38:16,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:16,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:16,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:16,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:16,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:38:16,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:16,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:16,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-11-23 12:38:16,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:16,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:16,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:16,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:16,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:38:16,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:16,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:16,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:16,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:16,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:38:16,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:16,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:16,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:16,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:38:16,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:38:16,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:16,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-11-23 12:38:16,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:16,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:16,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:16,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:16,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:38:16,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:16,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:38:16,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:38:16,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:38:16,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:38:16,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:38:16,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:38:16,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:38:16,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:38:16,166 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:38:16,170 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 12:38:16,170 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 12:38:16,170 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:38:16,171 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-23 12:38:16,171 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:38:16,171 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0, ULTIMATE.start_entry_point_~j~0) = 1*ULTIMATE.start_entry_point_~len~0 + 20*ULTIMATE.start_entry_point_~j~0 Supporting invariants [1*ULTIMATE.start_entry_point_~len~0 - 10 >= 0] [2018-11-23 12:38:16,213 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-23 12:38:16,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:38:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:38:16,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:38:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:38:16,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:38:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:38:16,271 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 12:38:16,271 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-23 12:38:16,296 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 19 states and 22 transitions. Complement of second has 5 states. [2018-11-23 12:38:16,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 12:38:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:38:16,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-23 12:38:16,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-23 12:38:16,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:38:16,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 17 letters. Loop has 2 letters. [2018-11-23 12:38:16,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:38:16,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-23 12:38:16,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:38:16,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2018-11-23 12:38:16,299 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 12:38:16,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2018-11-23 12:38:16,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 12:38:16,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 12:38:16,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 12:38:16,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:38:16,299 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:38:16,299 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:38:16,299 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:38:16,299 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 12:38:16,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:38:16,300 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 12:38:16,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 12:38:16,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 12:38:16 BoogieIcfgContainer [2018-11-23 12:38:16,307 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 12:38:16,307 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:38:16,307 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:38:16,307 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:38:16,308 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:38:13" (3/4) ... [2018-11-23 12:38:16,310 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 12:38:16,311 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:38:16,311 INFO L168 Benchmark]: Toolchain (without parser) took 3670.36 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.0 MB). Free memory was 956.4 MB in the beginning and 884.6 MB in the end (delta: 71.8 MB). Peak memory consumption was 297.8 MB. Max. memory is 11.5 GB. [2018-11-23 12:38:16,312 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:38:16,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 443.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:38:16,313 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.87 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-11-23 12:38:16,313 INFO L168 Benchmark]: Boogie Preprocessor took 19.41 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-11-23 12:38:16,313 INFO L168 Benchmark]: RCFGBuilder took 193.18 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.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:38:16,314 INFO L168 Benchmark]: BuchiAutomizer took 2978.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 884.6 MB in the end (delta: 213.8 MB). Peak memory consumption was 289.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:38:16,314 INFO L168 Benchmark]: Witness Printer took 3.52 ms. Allocated memory is still 1.3 GB. Free memory is still 884.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:38:16,317 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 443.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.87 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 19.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 193.18 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.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2978.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 884.6 MB in the end (delta: 213.8 MB). Peak memory consumption was 289.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.52 ms. Allocated memory is still 1.3 GB. Free memory is still 884.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len + -1 * i and consists of 3 locations. One deterministic module has affine ranking function len + 20 * j and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 84 SDtfs, 71 SDslu, 72 SDs, 0 SdLazy, 60 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital237 mio100 ax112 hnf101 lsp81 ukn53 mio100 lsp57 div100 bol100 ite100 ukn100 eq187 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 3 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...