./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5a9cddc2-6966-4901-aed7-8ed6a71a7537/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5a9cddc2-6966-4901-aed7-8ed6a71a7537/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5a9cddc2-6966-4901-aed7-8ed6a71a7537/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5a9cddc2-6966-4901-aed7-8ed6a71a7537/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5a9cddc2-6966-4901-aed7-8ed6a71a7537/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5a9cddc2-6966-4901-aed7-8ed6a71a7537/bin/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 09bd2b4d877b02d6e4448e44897944243667e3ce ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:57:02,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:02,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:02,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:02,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:02,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:02,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:02,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:02,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:02,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:02,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:02,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:02,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:02,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:02,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:02,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:02,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:02,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:02,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:02,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:02,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:02,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:02,870 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:02,871 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:02,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:02,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:02,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:02,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:02,876 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:02,877 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:02,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:02,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:02,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:02,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:02,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:02,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:02,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:02,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:02,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:02,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:02,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:02,884 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5a9cddc2-6966-4901-aed7-8ed6a71a7537/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:57:02,897 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:02,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:02,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:02,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:02,903 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:02,903 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:57:02,903 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:57:02,903 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:57:02,903 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:57:02,904 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:57:02,904 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:57:02,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:02,904 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:57:02,904 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:57:02,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:02,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:57:02,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:02,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:57:02,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:57:02,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:57:02,906 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:57:02,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:02,906 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:57:02,906 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:02,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:57:02,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:02,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:02,907 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:57:02,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:02,907 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:02,907 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:57:02,908 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:57:02,908 INFO L138 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_5a9cddc2-6966-4901-aed7-8ed6a71a7537/bin/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 -> 09bd2b4d877b02d6e4448e44897944243667e3ce [2019-10-22 08:57:02,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:02,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:02,968 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:02,970 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:02,971 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:02,971 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5a9cddc2-6966-4901-aed7-8ed6a71a7537/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2019-10-22 08:57:03,018 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a9cddc2-6966-4901-aed7-8ed6a71a7537/bin/uautomizer/data/73729a13f/48904555e24e42b79b013a17925c2c66/FLAG6d90de012 [2019-10-22 08:57:03,472 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:03,472 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5a9cddc2-6966-4901-aed7-8ed6a71a7537/sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2019-10-22 08:57:03,491 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a9cddc2-6966-4901-aed7-8ed6a71a7537/bin/uautomizer/data/73729a13f/48904555e24e42b79b013a17925c2c66/FLAG6d90de012 [2019-10-22 08:57:03,992 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5a9cddc2-6966-4901-aed7-8ed6a71a7537/bin/uautomizer/data/73729a13f/48904555e24e42b79b013a17925c2c66 [2019-10-22 08:57:03,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:03,997 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:03,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:03,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:04,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:04,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:03" (1/1) ... [2019-10-22 08:57:04,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e773620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04, skipping insertion in model container [2019-10-22 08:57:04,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:03" (1/1) ... [2019-10-22 08:57:04,013 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:04,055 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:04,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:04,558 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:04,625 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:04,687 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:04,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04 WrapperNode [2019-10-22 08:57:04,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:04,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:04,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:04,689 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:04,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:04,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:04,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:04,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:04,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:04,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:04,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:04,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:04,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9cddc2-6966-4901-aed7-8ed6a71a7537/bin/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 [2019-10-22 08:57:04,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:57:04,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 08:57:04,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:57:04,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 08:57:04,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:57:04,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 08:57:04,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:04,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:05,056 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:05,056 INFO L284 CfgBuilder]: Removed 12 assume(true) statements. [2019-10-22 08:57:05,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:05 BoogieIcfgContainer [2019-10-22 08:57:05,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:05,058 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:57:05,058 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:57:05,062 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:57:05,063 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:05,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:57:03" (1/3) ... [2019-10-22 08:57:05,064 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bf121ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:05, skipping insertion in model container [2019-10-22 08:57:05,064 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:05,064 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (2/3) ... [2019-10-22 08:57:05,065 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bf121ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:05, skipping insertion in model container [2019-10-22 08:57:05,065 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:05,065 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:05" (3/3) ... [2019-10-22 08:57:05,068 INFO L371 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_2.i [2019-10-22 08:57:05,128 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:57:05,128 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:57:05,128 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:57:05,128 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:05,128 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:05,128 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:57:05,129 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:05,129 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:57:05,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 08:57:05,169 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:57:05,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:05,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:05,176 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:05,176 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:05,176 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:57:05,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 08:57:05,178 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:57:05,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:05,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:05,178 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:05,178 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:05,184 INFO L791 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.allocOnStack(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); 10#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; 18#L527true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 14#L530true 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; 9#L767true assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 13#L768-3true [2019-10-22 08:57:05,185 INFO L793 eck$LassoCheckResult]: Loop: 13#L768-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; 4#L527-1true assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 16#L530-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; 6#L770true 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); 11#L768-2true entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 13#L768-3true [2019-10-22 08:57:05,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:05,190 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-10-22 08:57:05,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:05,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494947768] [2019-10-22 08:57:05,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:05,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:05,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:05,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494947768] [2019-10-22 08:57:05,384 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:05,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:05,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368897748] [2019-10-22 08:57:05,389 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:57:05,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:05,389 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 1 times [2019-10-22 08:57:05,389 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:05,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115210846] [2019-10-22 08:57:05,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:05,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:05,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:05,445 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:05,626 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-10-22 08:57:05,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:05,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:05,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:05,724 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2019-10-22 08:57:05,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:05,793 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-10-22 08:57:05,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:05,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-10-22 08:57:05,797 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-10-22 08:57:05,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 20 states and 23 transitions. [2019-10-22 08:57:05,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 08:57:05,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 08:57:05,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-10-22 08:57:05,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:05,809 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-22 08:57:05,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-10-22 08:57:05,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2019-10-22 08:57:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:57:05,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-10-22 08:57:05,839 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-10-22 08:57:05,839 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-10-22 08:57:05,839 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:57:05,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2019-10-22 08:57:05,840 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:57:05,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:05,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:05,842 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:05,842 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:05,843 INFO L791 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(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); 69#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; 70#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 72#L530 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; 67#L767 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 68#L768-3 [2019-10-22 08:57:05,843 INFO L793 eck$LassoCheckResult]: Loop: 68#L768-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; 62#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 63#L530-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; 64#L770 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); 66#L768-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 68#L768-3 [2019-10-22 08:57:05,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:05,843 INFO L82 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2019-10-22 08:57:05,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:05,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973326976] [2019-10-22 08:57:05,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:05,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:05,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:05,893 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:05,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:05,894 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 2 times [2019-10-22 08:57:05,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:05,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896975459] [2019-10-22 08:57:05,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:05,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:05,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:05,944 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:05,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:05,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1173278059, now seen corresponding path program 1 times [2019-10-22 08:57:05,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:05,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649912107] [2019-10-22 08:57:05,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:05,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:05,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:05,994 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:06,150 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-10-22 08:57:06,420 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-10-22 08:57:06,526 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:06,527 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:06,527 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:06,527 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:06,527 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:06,527 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:06,528 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:06,528 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:06,528 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_2.i_Iteration2_Lasso [2019-10-22 08:57:06,528 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:06,528 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:06,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:06,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:06,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:06,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:06,820 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-10-22 08:57:06,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:06,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:06,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:06,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:06,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:06,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:06,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:06,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:06,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:06,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:06,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:06,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:06,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:06,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:07,468 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-10-22 08:57:07,679 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:07,689 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:07,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:07,693 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:07,694 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:07,694 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:07,694 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:07,698 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:07,701 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:07,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:07,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:07,713 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:07,713 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:07,713 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:07,713 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:07,714 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:07,714 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:07,714 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:07,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:07,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:07,716 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:07,716 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:07,716 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:07,716 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:07,716 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:07,717 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:07,717 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:07,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:07,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:07,728 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:07,728 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:07,729 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:07,729 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:07,730 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:07,730 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:07,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:07,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:07,745 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:07,746 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:07,747 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:07,747 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:07,748 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:07,748 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:07,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:07,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:07,766 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:07,771 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:07,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:07,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:07,771 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:07,772 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:07,772 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:07,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:07,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:07,774 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:07,774 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:07,775 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:07,775 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:07,776 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:07,776 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:07,788 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:07,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:07,797 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:07,798 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:07,798 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:07,798 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:07,798 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:07,799 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:07,799 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:07,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:07,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:07,801 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:07,801 INFO L202 nArgumentSynthesizer]: 3 stem disjuncts [2019-10-22 08:57:07,801 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:07,801 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:07,831 INFO L400 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2019-10-22 08:57:07,832 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:57:08,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:08,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:08,007 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:08,008 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:08,009 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:08,009 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:08,015 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:08,017 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:08,074 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:08,149 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:57:08,149 INFO L444 ModelExtractionUtils]: 35 out of 43 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 08:57:08,155 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:08,156 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:08,156 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:08,157 INFO L512 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 [] [2019-10-22 08:57:08,175 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 08:57:08,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:08,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:08,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:08,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:57:08,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:08,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:08,261 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 [2019-10-22 08:57:08,262 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-10-22 08:57:08,304 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 21 states and 26 transitions. Complement of second has 4 states. [2019-10-22 08:57:08,304 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 [2019-10-22 08:57:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-10-22 08:57:08,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 5 letters. [2019-10-22 08:57:08,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:08,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 5 letters. [2019-10-22 08:57:08,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:08,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 10 letters. [2019-10-22 08:57:08,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:08,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2019-10-22 08:57:08,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:57:08,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 21 transitions. [2019-10-22 08:57:08,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:57:08,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:57:08,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2019-10-22 08:57:08,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:08,312 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-10-22 08:57:08,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2019-10-22 08:57:08,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-22 08:57:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:57:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-10-22 08:57:08,314 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-10-22 08:57:08,314 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-10-22 08:57:08,314 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:57:08,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-10-22 08:57:08,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:57:08,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:08,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:08,316 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:08,316 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:57:08,316 INFO L791 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(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); 176#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; 177#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 180#L530 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; 174#L767 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 175#L768-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; 166#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 167#L530-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; 170#L770 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 171#L770-1 entry_point_~j~0 := entry_point_~i~0 - 1; 164#L775-3 [2019-10-22 08:57:08,316 INFO L793 eck$LassoCheckResult]: Loop: 164#L775-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; 165#L775-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 164#L775-3 [2019-10-22 08:57:08,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:08,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1173218534, now seen corresponding path program 1 times [2019-10-22 08:57:08,317 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:08,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076274517] [2019-10-22 08:57:08,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:08,337 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:08,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:08,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 1 times [2019-10-22 08:57:08,338 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:08,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539066846] [2019-10-22 08:57:08,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:08,346 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:08,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:08,346 INFO L82 PathProgramCache]: Analyzing trace with hash 2113389244, now seen corresponding path program 1 times [2019-10-22 08:57:08,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:08,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611004869] [2019-10-22 08:57:08,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:08,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611004869] [2019-10-22 08:57:08,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:08,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:08,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681958514] [2019-10-22 08:57:08,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:08,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:08,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:08,401 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-10-22 08:57:08,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:08,429 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-10-22 08:57:08,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:08,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2019-10-22 08:57:08,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:57:08,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 25 transitions. [2019-10-22 08:57:08,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:57:08,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:57:08,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2019-10-22 08:57:08,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:08,432 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-22 08:57:08,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2019-10-22 08:57:08,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2019-10-22 08:57:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:57:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-10-22 08:57:08,434 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 08:57:08,434 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 08:57:08,434 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:57:08,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-10-22 08:57:08,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:57:08,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:08,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:08,436 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:08,436 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:57:08,436 INFO L791 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(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#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 234#L530 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; 228#L767 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 229#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 222#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 223#L530-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; 226#L770 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); 227#L768-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 232#L768-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; 220#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 221#L530-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; 224#L770 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 225#L770-1 entry_point_~j~0 := entry_point_~i~0 - 1; 218#L775-3 [2019-10-22 08:57:08,436 INFO L793 eck$LassoCheckResult]: Loop: 218#L775-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; 219#L775-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 218#L775-3 [2019-10-22 08:57:08,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:08,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1659616398, now seen corresponding path program 1 times [2019-10-22 08:57:08,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:08,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848904453] [2019-10-22 08:57:08,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:08,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848904453] [2019-10-22 08:57:08,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:08,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:08,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651243955] [2019-10-22 08:57:08,468 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:57:08,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:08,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 2 times [2019-10-22 08:57:08,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:08,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088803656] [2019-10-22 08:57:08,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:08,476 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:08,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:08,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:08,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:08,504 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-10-22 08:57:08,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:08,531 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-10-22 08:57:08,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:08,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2019-10-22 08:57:08,533 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:57:08,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 24 transitions. [2019-10-22 08:57:08,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 08:57:08,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:57:08,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2019-10-22 08:57:08,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:08,534 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-22 08:57:08,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2019-10-22 08:57:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2019-10-22 08:57:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:57:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-22 08:57:08,536 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-22 08:57:08,536 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-22 08:57:08,536 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:57:08,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2019-10-22 08:57:08,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:57:08,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:08,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:08,537 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:08,537 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:57:08,538 INFO L791 eck$LassoCheckResult]: Stem: 283#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(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); 280#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; 281#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 284#L530 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; 278#L767 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 279#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 272#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 273#L530-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; 276#L770 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#L768-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 282#L768-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; 270#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 271#L530-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; 274#L770 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 275#L770-1 entry_point_~j~0 := entry_point_~i~0 - 1; 268#L775-3 [2019-10-22 08:57:08,538 INFO L793 eck$LassoCheckResult]: Loop: 268#L775-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; 269#L775-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 268#L775-3 [2019-10-22 08:57:08,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:08,539 INFO L82 PathProgramCache]: Analyzing trace with hash 979558028, now seen corresponding path program 1 times [2019-10-22 08:57:08,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:08,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866837791] [2019-10-22 08:57:08,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:08,563 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:08,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:08,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 3 times [2019-10-22 08:57:08,564 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:08,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256581515] [2019-10-22 08:57:08,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:08,570 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:08,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:08,571 INFO L82 PathProgramCache]: Analyzing trace with hash 757428654, now seen corresponding path program 1 times [2019-10-22 08:57:08,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:08,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991175226] [2019-10-22 08:57:08,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:08,595 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:09,088 WARN L191 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 145 [2019-10-22 08:57:09,193 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:09,193 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:09,193 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:09,193 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:09,193 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:09,193 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:09,194 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:09,194 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:09,194 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_2.i_Iteration5_Lasso [2019-10-22 08:57:09,194 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:09,194 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:09,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:09,808 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-10-22 08:57:09,911 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:09,911 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:09,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,912 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,912 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:09,912 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,912 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,913 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,913 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:09,913 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:09,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,915 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,915 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,915 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,915 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,916 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:09,916 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:09,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,919 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,920 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:09,920 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,920 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,920 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,920 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:09,920 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:09,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,921 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,922 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,922 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,922 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,923 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:09,923 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:09,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,925 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,925 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,926 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,926 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,927 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:09,927 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:09,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,929 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,929 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:09,929 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,929 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,929 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,930 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:09,930 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:09,930 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,931 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,931 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,931 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,931 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,932 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:09,932 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:09,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,935 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,935 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:09,935 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,935 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,935 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,936 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:09,936 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:09,936 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,937 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,937 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:09,937 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,937 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,937 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,938 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:09,938 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:09,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,940 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,940 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:09,940 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,940 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,940 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,940 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:09,940 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:09,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,941 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,942 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,942 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,942 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,943 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:09,943 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:09,945 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,946 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,946 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:09,946 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,946 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,946 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,947 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:09,947 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:09,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,948 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,948 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:09,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,948 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,949 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:09,949 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:09,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,950 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,951 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,951 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,951 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,951 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:09,952 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:09,953 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,954 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,954 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,954 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,954 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,955 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:09,955 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:09,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,957 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,958 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,958 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,958 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,959 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:09,959 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:09,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,961 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,961 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:09,961 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,961 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,961 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,962 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:09,962 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:09,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,963 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,963 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:09,964 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,964 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,964 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,964 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:09,964 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:09,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,965 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,965 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:09,966 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,966 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,966 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,967 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:09,967 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:09,967 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,968 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,968 INFO L202 nArgumentSynthesizer]: 5 stem disjuncts [2019-10-22 08:57:09,968 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,968 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,971 INFO L400 nArgumentSynthesizer]: We have 14 Motzkin's Theorem applications. [2019-10-22 08:57:09,971 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:09,980 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:09,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:09,981 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:09,981 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:09,981 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:09,981 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:09,983 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:09,983 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:10,000 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:10,011 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:57:10,012 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:57:10,012 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:10,013 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:10,013 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:10,013 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~j~0) = 2*ULTIMATE.start_entry_point_~j~0 + 1 Supporting invariants [] [2019-10-22 08:57:10,033 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 08:57:10,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:10,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:10,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:10,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:57:10,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:10,094 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 [2019-10-22 08:57:10,094 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-10-22 08:57:10,102 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 22 transitions. Complement of second has 4 states. [2019-10-22 08:57:10,102 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 [2019-10-22 08:57:10,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:10,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-10-22 08:57:10,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 15 letters. Loop has 2 letters. [2019-10-22 08:57:10,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:10,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 17 letters. Loop has 2 letters. [2019-10-22 08:57:10,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:10,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2019-10-22 08:57:10,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:10,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2019-10-22 08:57:10,104 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:10,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-10-22 08:57:10,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:57:10,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:57:10,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:57:10,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:10,105 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:10,105 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:10,105 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:10,105 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:57:10,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:57:10,106 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:10,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:57:10,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:57:10 BoogieIcfgContainer [2019-10-22 08:57:10,112 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:57:10,112 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:10,113 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:10,113 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:10,113 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:05" (3/4) ... [2019-10-22 08:57:10,117 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:57:10,117 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:10,118 INFO L168 Benchmark]: Toolchain (without parser) took 6121.83 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 939.1 MB in the beginning and 1.3 GB in the end (delta: -318.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:10,119 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:10,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 690.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -158.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:10,120 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.61 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:10,120 INFO L168 Benchmark]: Boogie Preprocessor took 25.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:10,121 INFO L168 Benchmark]: RCFGBuilder took 289.17 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: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:10,121 INFO L168 Benchmark]: BuchiAutomizer took 5054.04 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -189.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:10,121 INFO L168 Benchmark]: Witness Printer took 4.35 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:10,124 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 690.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -158.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.61 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 289.17 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: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5054.04 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -189.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.35 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 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 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len + -1 * i and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 85 SDtfs, 59 SDslu, 71 SDs, 0 SdLazy, 59 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital256 mio100 ax111 hnf101 lsp83 ukn55 mio100 lsp56 div100 bol100 ite100 ukn100 eq190 hnf92 smp100 dnf195 smp66 tf100 neg94 sie124 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 205ms VariablesStem: 7 VariablesLoop: 8 DisjunctsStem: 3 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 24 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...