./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1_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_c4d505e1-bf01-492e-a5e8-51e6e5420661/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c4d505e1-bf01-492e-a5e8-51e6e5420661/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c4d505e1-bf01-492e-a5e8-51e6e5420661/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c4d505e1-bf01-492e-a5e8-51e6e5420661/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c4d505e1-bf01-492e-a5e8-51e6e5420661/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c4d505e1-bf01-492e-a5e8-51e6e5420661/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 1e7b1c8d88255aaa07a4a2fabadf999511fb9c76 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 05:51:29,873 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:51:29,874 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:51:29,881 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:51:29,881 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:51:29,882 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:51:29,883 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:51:29,884 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:51:29,885 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:51:29,885 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:51:29,886 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:51:29,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:51:29,886 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:51:29,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:51:29,888 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:51:29,888 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:51:29,889 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:51:29,890 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:51:29,891 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:51:29,892 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:51:29,893 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:51:29,894 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:51:29,895 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:51:29,896 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:51:29,896 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:51:29,897 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:51:29,897 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:51:29,898 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:51:29,898 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:51:29,899 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:51:29,899 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:51:29,900 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:51:29,900 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:51:29,900 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:51:29,901 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:51:29,901 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:51:29,901 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c4d505e1-bf01-492e-a5e8-51e6e5420661/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 05:51:29,912 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:51:29,912 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:51:29,913 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:51:29,913 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:51:29,913 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:51:29,914 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 05:51:29,914 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 05:51:29,914 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 05:51:29,914 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 05:51:29,914 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 05:51:29,914 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 05:51:29,914 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:51:29,915 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:51:29,915 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 05:51:29,915 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:51:29,915 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:51:29,915 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:51:29,915 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 05:51:29,915 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 05:51:29,915 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 05:51:29,915 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:51:29,916 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:51:29,916 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 05:51:29,916 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:51:29,916 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 05:51:29,916 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:51:29,916 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:51:29,916 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 05:51:29,916 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:51:29,917 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:51:29,917 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 05:51:29,917 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 05:51:29,917 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_c4d505e1-bf01-492e-a5e8-51e6e5420661/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 -> 1e7b1c8d88255aaa07a4a2fabadf999511fb9c76 [2018-11-23 05:51:29,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:51:29,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:51:29,949 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:51:29,950 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:51:29,950 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:51:29,950 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c4d505e1-bf01-492e-a5e8-51e6e5420661/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-11-23 05:51:29,988 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4d505e1-bf01-492e-a5e8-51e6e5420661/bin-2019/uautomizer/data/92d1a0a23/0e1c11e99ceb475496f1c49741e01715/FLAG4bbd2cf70 [2018-11-23 05:51:30,442 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:51:30,443 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c4d505e1-bf01-492e-a5e8-51e6e5420661/sv-benchmarks/c/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-11-23 05:51:30,453 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4d505e1-bf01-492e-a5e8-51e6e5420661/bin-2019/uautomizer/data/92d1a0a23/0e1c11e99ceb475496f1c49741e01715/FLAG4bbd2cf70 [2018-11-23 05:51:30,462 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c4d505e1-bf01-492e-a5e8-51e6e5420661/bin-2019/uautomizer/data/92d1a0a23/0e1c11e99ceb475496f1c49741e01715 [2018-11-23 05:51:30,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:51:30,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:51:30,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:51:30,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:51:30,468 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:51:30,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:51:30" (1/1) ... [2018-11-23 05:51:30,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174bb65b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:30, skipping insertion in model container [2018-11-23 05:51:30,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:51:30" (1/1) ... [2018-11-23 05:51:30,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:51:30,509 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:51:30,779 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:51:30,789 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:51:30,835 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:51:30,869 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:51:30,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:30 WrapperNode [2018-11-23 05:51:30,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:51:30,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:51:30,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:51:30,870 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:51:30,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:30" (1/1) ... [2018-11-23 05:51:30,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:30" (1/1) ... [2018-11-23 05:51:30,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:51:30,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:51:30,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:51:30,905 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:51:30,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:30" (1/1) ... [2018-11-23 05:51:30,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:30" (1/1) ... [2018-11-23 05:51:30,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:30" (1/1) ... [2018-11-23 05:51:30,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:30" (1/1) ... [2018-11-23 05:51:30,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:30" (1/1) ... [2018-11-23 05:51:30,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:30" (1/1) ... [2018-11-23 05:51:30,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:30" (1/1) ... [2018-11-23 05:51:30,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:51:30,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:51:30,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:51:30,921 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:51:30,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4d505e1-bf01-492e-a5e8-51e6e5420661/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 05:51:30,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:51:30,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 05:51:30,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 05:51:30,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:51:30,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 05:51:30,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:51:30,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:51:31,128 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:51:31,128 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 05:51:31,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:51:31 BoogieIcfgContainer [2018-11-23 05:51:31,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:51:31,129 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 05:51:31,129 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 05:51:31,131 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 05:51:31,132 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:51:31,132 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 05:51:30" (1/3) ... [2018-11-23 05:51:31,133 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ad7d0c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:51:31, skipping insertion in model container [2018-11-23 05:51:31,133 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:51:31,133 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:30" (2/3) ... [2018-11-23 05:51:31,133 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ad7d0c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:51:31, skipping insertion in model container [2018-11-23 05:51:31,133 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:51:31,133 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:51:31" (3/3) ... [2018-11-23 05:51:31,135 INFO L375 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-11-23 05:51:31,165 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:51:31,165 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 05:51:31,165 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 05:51:31,165 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 05:51:31,165 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:51:31,166 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:51:31,166 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 05:51:31,166 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:51:31,166 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 05:51:31,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-23 05:51:31,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 05:51:31,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:51:31,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:51:31,198 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 05:51:31,198 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 05:51:31,198 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 05:51:31,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-23 05:51:31,199 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 05:51:31,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:51:31,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:51:31,200 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 05:51:31,200 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 05:51:31,204 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; 15#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 05:51:31,204 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; 17#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; 14#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 05:51:31,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:31,208 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-23 05:51:31,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:51:31,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:51:31,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:31,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:51:31,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:51:31,337 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 05:51:31,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:51:31,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:51:31,341 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:51:31,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:31,341 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 1 times [2018-11-23 05:51:31,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:51:31,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:51:31,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:31,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:51:31,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:31,538 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-23 05:51:31,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:51:31,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:51:31,603 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2018-11-23 05:51:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:51:31,645 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-23 05:51:31,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:51:31,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-11-23 05:51:31,649 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-23 05:51:31,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 25 transitions. [2018-11-23 05:51:31,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 05:51:31,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 05:51:31,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2018-11-23 05:51:31,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:51:31,655 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-23 05:51:31,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2018-11-23 05:51:31,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2018-11-23 05:51:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 05:51:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-23 05:51:31,675 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-23 05:51:31,675 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-23 05:51:31,675 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 05:51:31,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-23 05:51:31,676 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 05:51:31,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:51:31,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:51:31,676 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 05:51:31,676 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 05:51:31,677 INFO L794 eck$LassoCheckResult]: Stem: 69#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); 64#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; 65#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; 66#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; 57#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 58#L1445-3 [2018-11-23 05:51:31,677 INFO L796 eck$LassoCheckResult]: Loop: 58#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; 61#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; 67#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; 68#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); 59#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 58#L1445-3 [2018-11-23 05:51:31,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:31,677 INFO L82 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2018-11-23 05:51:31,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:51:31,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:51:31,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:31,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:51:31,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:31,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:31,695 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 2 times [2018-11-23 05:51:31,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:51:31,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:51:31,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:31,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:51:31,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:31,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:31,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1173278059, now seen corresponding path program 1 times [2018-11-23 05:51:31,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:51:31,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:51:31,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:31,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:51:31,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:31,845 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-23 05:51:32,001 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2018-11-23 05:51:32,060 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:51:32,061 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:51:32,061 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:51:32,061 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:51:32,061 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:51:32,061 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:51:32,062 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:51:32,062 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:51:32,062 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_1_false-valid-memtrack_true-termination.i_Iteration2_Lasso [2018-11-23 05:51:32,062 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:51:32,062 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:51:32,084 INFO 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 05:51:32,089 INFO 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 05:51:32,092 INFO 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 05:51:32,093 INFO 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 05:51:32,095 INFO 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 05:51:32,096 INFO 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 05:51:32,098 INFO 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 05:51:32,100 INFO 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 05:51:32,103 INFO 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 05:51:32,107 INFO 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 05:51:32,117 INFO 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 05:51:32,118 INFO 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 05:51:32,119 INFO 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 05:51:32,121 INFO 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 05:51:32,122 INFO 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 05:51:32,124 INFO 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 05:51:32,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:51:32,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:51:32,597 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:51:32,602 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:51:32,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:32,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:32,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:51:32,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:32,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:32,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:32,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:32,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:32,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:32,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:32,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:32,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:32,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:32,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:32,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:32,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:32,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:32,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:32,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:32,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:32,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:32,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:32,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:32,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:32,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:32,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,622 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:51:32,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:32,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:32,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:32,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:32,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:32,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:32,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:32,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:32,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:51:32,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:32,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:32,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:32,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:32,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:32,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:32,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:32,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:32,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:32,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:32,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:32,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:32,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:32,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:51:32,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:32,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:32,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:32,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:32,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:51:32,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:32,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:32,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:32,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:32,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:32,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:32,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:32,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:32,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:32,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:32,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:32,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:32,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:32,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:32,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:32,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:32,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:51:32,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:32,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:32,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:51:32,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:32,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:32,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:32,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:32,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:32,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:51:32,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:32,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:51:32,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:32,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:32,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:51:32,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:32,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:32,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:32,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:32,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:32,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:51:32,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:32,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:51:32,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:32,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:32,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:51:32,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,682 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:51:32,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,686 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:51:32,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:32,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:32,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:32,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:32,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,699 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:51:32,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:32,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:32,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:51:32,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:32,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:32,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:32,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:32,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:51:32,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:32,787 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:51:32,821 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 05:51:32,821 INFO L444 ModelExtractionUtils]: 31 out of 43 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-11-23 05:51:32,823 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:51:32,824 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:51:32,824 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:51:32,825 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 05:51:32,845 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-23 05:51:32,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:51:32,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:51:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:51:32,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:51:32,915 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 05:51:32,917 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 05:51:32,918 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 05:51:32,944 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 27 states and 36 transitions. Complement of second has 6 states. [2018-11-23 05:51:32,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 05:51:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:51:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-23 05:51:32,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-23 05:51:32,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:51:32,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-23 05:51:32,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:51:32,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-23 05:51:32,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:51:32,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2018-11-23 05:51:32,949 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 05:51:32,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 20 states and 26 transitions. [2018-11-23 05:51:32,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 05:51:32,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 05:51:32,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2018-11-23 05:51:32,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:51:32,951 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-23 05:51:32,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2018-11-23 05:51:32,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-23 05:51:32,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 05:51:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-11-23 05:51:32,952 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-23 05:51:32,952 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-23 05:51:32,952 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 05:51:32,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-11-23 05:51:32,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:51:32,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:51:32,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:51:32,953 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:51:32,953 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:51:32,953 INFO L794 eck$LassoCheckResult]: Stem: 186#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); 179#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; 180#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; 181#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; 170#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 171#L1445-3 assume !(entry_point_~i~0 < entry_point_~len~0); 174#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 177#L1452-3 [2018-11-23 05:51:32,953 INFO L796 eck$LassoCheckResult]: Loop: 177#L1452-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; 178#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 177#L1452-3 [2018-11-23 05:51:32,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:32,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1804968475, now seen corresponding path program 1 times [2018-11-23 05:51:32,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:51:32,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:51:32,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:32,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:51:32,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:51:32,983 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 05:51:32,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:51:32,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:51:32,983 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:51:32,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:32,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 1 times [2018-11-23 05:51:32,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:51:32,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:51:32,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:32,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:51:32,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:33,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:51:33,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:51:33,009 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-23 05:51:33,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:51:33,021 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2018-11-23 05:51:33,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:51:33,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-11-23 05:51:33,022 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 05:51:33,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 34 transitions. [2018-11-23 05:51:33,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-23 05:51:33,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-23 05:51:33,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2018-11-23 05:51:33,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:51:33,023 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-23 05:51:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2018-11-23 05:51:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-11-23 05:51:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 05:51:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-11-23 05:51:33,024 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-23 05:51:33,024 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-23 05:51:33,024 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 05:51:33,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2018-11-23 05:51:33,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:51:33,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:51:33,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:51:33,025 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:51:33,025 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:51:33,026 INFO L794 eck$LassoCheckResult]: Stem: 237#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); 230#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; 231#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; 232#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; 221#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 222#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; 225#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 233#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; 234#L1447 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 227#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 228#L1452-3 [2018-11-23 05:51:33,026 INFO L796 eck$LassoCheckResult]: Loop: 228#L1452-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; 229#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 228#L1452-3 [2018-11-23 05:51:33,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:33,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1173218535, now seen corresponding path program 1 times [2018-11-23 05:51:33,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:51:33,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:51:33,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:51:33,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:33,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:33,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 2 times [2018-11-23 05:51:33,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:51:33,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:51:33,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:51:33,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:33,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:33,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2113388251, now seen corresponding path program 1 times [2018-11-23 05:51:33,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:51:33,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:51:33,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:51:33,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:51:33,075 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 05:51:33,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:51:33,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:51:33,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:51:33,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:51:33,094 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-23 05:51:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:51:33,115 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-23 05:51:33,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:51:33,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-11-23 05:51:33,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:51:33,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 26 transitions. [2018-11-23 05:51:33,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 05:51:33,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 05:51:33,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2018-11-23 05:51:33,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:51:33,117 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-23 05:51:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2018-11-23 05:51:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-11-23 05:51:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 05:51:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-23 05:51:33,118 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-23 05:51:33,119 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-23 05:51:33,119 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 05:51:33,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-23 05:51:33,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:51:33,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:51:33,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:51:33,120 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:51:33,120 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:51:33,120 INFO L794 eck$LassoCheckResult]: Stem: 291#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); 284#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; 285#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; 286#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; 275#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 276#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; 279#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 289#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; 290#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); 277#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 278#L1445-3 assume !(entry_point_~i~0 < entry_point_~len~0); 280#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 282#L1452-3 [2018-11-23 05:51:33,120 INFO L796 eck$LassoCheckResult]: Loop: 282#L1452-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; 283#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 282#L1452-3 [2018-11-23 05:51:33,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:33,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2113443111, now seen corresponding path program 1 times [2018-11-23 05:51:33,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:51:33,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:51:33,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:51:33,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:51:33,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:51:33,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:51:33,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:51:33,145 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:51:33,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:33,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 3 times [2018-11-23 05:51:33,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:51:33,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:51:33,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:51:33,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:33,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:51:33,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:51:33,177 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-23 05:51:33,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:51:33,197 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 05:51:33,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:51:33,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2018-11-23 05:51:33,198 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 05:51:33,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 28 transitions. [2018-11-23 05:51:33,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 05:51:33,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 05:51:33,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2018-11-23 05:51:33,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:51:33,199 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 05:51:33,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2018-11-23 05:51:33,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-11-23 05:51:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 05:51:33,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-23 05:51:33,201 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-23 05:51:33,201 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-23 05:51:33,201 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 05:51:33,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-23 05:51:33,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:51:33,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:51:33,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:51:33,202 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:51:33,202 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:51:33,202 INFO L794 eck$LassoCheckResult]: Stem: 344#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); 337#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; 338#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; 339#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; 328#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 329#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; 332#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; 342#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; 343#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); 330#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 331#L1445-3 assume !(entry_point_~i~0 < entry_point_~len~0); 333#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 335#L1452-3 [2018-11-23 05:51:33,202 INFO L796 eck$LassoCheckResult]: Loop: 335#L1452-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; 336#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 335#L1452-3 [2018-11-23 05:51:33,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:33,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2056184809, now seen corresponding path program 1 times [2018-11-23 05:51:33,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:51:33,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:51:33,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:51:33,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:51:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:51:33,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:51:33,231 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4d505e1-bf01-492e-a5e8-51e6e5420661/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:51:33,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:51:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:51:33,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:51:33,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:51:33,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:51:33,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 05:51:33,336 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:51:33,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:33,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 4 times [2018-11-23 05:51:33,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:51:33,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:51:33,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:51:33,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:33,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 05:51:33,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:51:33,375 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-23 05:51:33,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:51:33,396 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-23 05:51:33,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:51:33,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2018-11-23 05:51:33,397 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 05:51:33,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 05:51:33,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-23 05:51:33,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-23 05:51:33,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2018-11-23 05:51:33,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:51:33,398 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 05:51:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2018-11-23 05:51:33,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2018-11-23 05:51:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 05:51:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-23 05:51:33,400 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-23 05:51:33,400 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-23 05:51:33,400 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 05:51:33,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2018-11-23 05:51:33,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:51:33,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:51:33,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:51:33,401 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:51:33,401 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:51:33,401 INFO L794 eck$LassoCheckResult]: Stem: 438#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); 431#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; 432#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; 433#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; 420#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 421#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; 424#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; 441#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; 440#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); 439#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 425#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; 427#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 434#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; 435#L1447 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 428#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 429#L1452-3 [2018-11-23 05:51:33,401 INFO L796 eck$LassoCheckResult]: Loop: 429#L1452-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; 430#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 429#L1452-3 [2018-11-23 05:51:33,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:33,401 INFO L82 PathProgramCache]: Analyzing trace with hash 979558027, now seen corresponding path program 1 times [2018-11-23 05:51:33,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:51:33,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:51:33,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:51:33,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:33,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:33,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 5 times [2018-11-23 05:51:33,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:51:33,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:51:33,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:51:33,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:33,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:33,419 INFO L82 PathProgramCache]: Analyzing trace with hash 757427661, now seen corresponding path program 1 times [2018-11-23 05:51:33,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:51:33,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:51:33,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:51:33,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:33,831 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 141 [2018-11-23 05:51:33,899 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:51:33,899 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:51:33,900 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:51:33,900 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:51:33,900 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:51:33,900 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:51:33,900 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:51:33,900 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:51:33,900 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_1_false-valid-memtrack_true-termination.i_Iteration7_Lasso [2018-11-23 05:51:33,900 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:51:33,900 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:51:33,903 INFO 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 05:51:33,911 INFO 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 05:51:33,912 INFO 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 05:51:33,914 INFO 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 05:51:33,915 INFO 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 05:51:33,916 INFO 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 05:51:33,919 INFO 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 05:51:33,920 INFO 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 05:51:33,924 INFO 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 05:51:33,926 INFO 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 05:51:33,927 INFO 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 05:51:33,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 05:51:33,930 INFO 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 05:51:33,932 INFO 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 05:51:33,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 05:51:33,935 INFO 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 05:51:33,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 05:51:33,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 05:51:33,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 05:51:33,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 05:51:34,041 INFO 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 05:51:34,044 INFO 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 05:51:34,219 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:51:34,219 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:51:34,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:34,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:51:34,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:34,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:34,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:34,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:34,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:34,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:34,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:51:34,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:34,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:34,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:51:34,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:34,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:34,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:34,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:34,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:34,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:34,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:51:34,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:34,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:51:34,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:34,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:34,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:34,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:51:34,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:34,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:34,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:34,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:34,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:34,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:34,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:34,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:34,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:34,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:34,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:34,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:34,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:51:34,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:34,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:34,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:34,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:34,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:34,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:34,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:51:34,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:34,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:51:34,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:51:34,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:34,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:34,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:34,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:34,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:34,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:34,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:34,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:34,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:34,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:34,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:51:34,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:34,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:34,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:51:34,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:34,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:34,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:34,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:34,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:34,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:34,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:51:34,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:51:34,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:51:34,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:51:34,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 05:51:34,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:51:34,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:51:34,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:51:34,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:51:34,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:51:34,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:51:34,275 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:51:34,278 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 05:51:34,279 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 05:51:34,279 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:51:34,280 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:51:34,280 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:51:34,280 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~j~0) = 2*ULTIMATE.start_entry_point_~j~0 + 1 Supporting invariants [] [2018-11-23 05:51:34,307 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-23 05:51:34,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:51:34,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:51:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:51:34,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:51:34,356 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 05:51:34,357 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 05:51:34,357 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 05:51:34,364 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 4 states. [2018-11-23 05:51:34,364 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 05:51:34,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:51:34,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-23 05:51:34,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-23 05:51:34,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:51:34,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2018-11-23 05:51:34,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:51:34,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-23 05:51:34,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:51:34,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2018-11-23 05:51:34,366 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 05:51:34,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-11-23 05:51:34,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 05:51:34,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 05:51:34,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 05:51:34,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:51:34,367 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:51:34,367 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:51:34,367 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:51:34,367 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 05:51:34,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 05:51:34,367 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 05:51:34,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 05:51:34,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 05:51:34 BoogieIcfgContainer [2018-11-23 05:51:34,372 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 05:51:34,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:51:34,373 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:51:34,373 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:51:34,373 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:51:31" (3/4) ... [2018-11-23 05:51:34,376 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 05:51:34,376 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:51:34,377 INFO L168 Benchmark]: Toolchain (without parser) took 3911.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 956.6 MB in the beginning and 1.0 GB in the end (delta: -52.5 MB). Peak memory consumption was 133.6 MB. Max. memory is 11.5 GB. [2018-11-23 05:51:34,377 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:51:34,378 INFO L168 Benchmark]: CACSL2BoogieTranslator took 403.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:51:34,378 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.27 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:51:34,379 INFO L168 Benchmark]: Boogie Preprocessor took 15.65 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:51:34,379 INFO L168 Benchmark]: RCFGBuilder took 208.05 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: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:51:34,379 INFO L168 Benchmark]: BuchiAutomizer took 3243.27 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.3 MB). Peak memory consumption was 131.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:51:34,380 INFO L168 Benchmark]: Witness Printer took 3.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:51:34,383 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 403.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.27 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.65 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 208.05 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: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3243.27 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.3 MB). Peak memory consumption was 131.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len + -1 * i and consists of 4 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 2.8s. 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 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 42 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 113 SDtfs, 146 SDslu, 108 SDs, 0 SdLazy, 92 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital237 mio100 ax112 hnf101 lsp81 ukn54 mio100 lsp59 div100 bol100 ite100 ukn100 eq189 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms 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...