./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_95e1beab-5236-4450-b09e-d9ace8579b84/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_95e1beab-5236-4450-b09e-d9ace8579b84/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_95e1beab-5236-4450-b09e-d9ace8579b84/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_95e1beab-5236-4450-b09e-d9ace8579b84/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5.i -s /tmp/vcloud-vcloud-master/worker/working_dir_95e1beab-5236-4450-b09e-d9ace8579b84/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_95e1beab-5236-4450-b09e-d9ace8579b84/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 64bit --witnessprinter.graph.data.programhash f7c8cd0f6441598a9b17eacee015376606f871a4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:59:45,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:45,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:45,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:45,797 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:45,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:45,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:45,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:45,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:45,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:45,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:45,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:45,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:45,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:45,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:45,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:45,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:45,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:45,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:45,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:45,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:45,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:45,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:45,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:45,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:45,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:45,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:45,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:45,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:45,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:45,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:45,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:45,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:45,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:45,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:45,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:45,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:45,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:45,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:45,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:45,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:45,835 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_95e1beab-5236-4450-b09e-d9ace8579b84/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:59:45,848 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:45,849 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:45,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:45,850 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:45,850 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:45,850 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:45,850 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:45,850 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:45,851 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:45,851 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:45,851 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:45,851 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:45,851 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:45,851 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:45,851 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:45,851 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:45,852 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:45,852 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:45,852 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:45,852 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:45,852 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:45,852 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:45,852 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:45,853 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:45,853 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:45,853 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:45,853 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:45,855 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:45,856 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:45,856 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_95e1beab-5236-4450-b09e-d9ace8579b84/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f7c8cd0f6441598a9b17eacee015376606f871a4 [2019-10-22 08:59:45,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:45,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:45,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:45,909 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:45,909 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:45,909 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_95e1beab-5236-4450-b09e-d9ace8579b84/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5.i [2019-10-22 08:59:45,963 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_95e1beab-5236-4450-b09e-d9ace8579b84/bin/uautomizer/data/7f98443b4/6865caeb41eb49dbb7e840346a132255/FLAGb11ed3522 [2019-10-22 08:59:46,368 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:46,369 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_95e1beab-5236-4450-b09e-d9ace8579b84/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5.i [2019-10-22 08:59:46,374 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_95e1beab-5236-4450-b09e-d9ace8579b84/bin/uautomizer/data/7f98443b4/6865caeb41eb49dbb7e840346a132255/FLAGb11ed3522 [2019-10-22 08:59:46,384 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_95e1beab-5236-4450-b09e-d9ace8579b84/bin/uautomizer/data/7f98443b4/6865caeb41eb49dbb7e840346a132255 [2019-10-22 08:59:46,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:46,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:46,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:46,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:46,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:46,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:46" (1/1) ... [2019-10-22 08:59:46,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ab2047e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:46, skipping insertion in model container [2019-10-22 08:59:46,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:46" (1/1) ... [2019-10-22 08:59:46,403 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:46,419 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:46,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:46,688 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:46,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:46,721 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:46,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:46 WrapperNode [2019-10-22 08:59:46,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:46,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:46,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:46,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:46,732 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:59:46" (1/1) ... [2019-10-22 08:59:46,740 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:59:46" (1/1) ... [2019-10-22 08:59:46,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:46,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:46,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:46,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:46,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:46" (1/1) ... [2019-10-22 08:59:46,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:46" (1/1) ... [2019-10-22 08:59:46,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:46" (1/1) ... [2019-10-22 08:59:46,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:46" (1/1) ... [2019-10-22 08:59:46,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:46" (1/1) ... [2019-10-22 08:59:46,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:46" (1/1) ... [2019-10-22 08:59:46,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:46" (1/1) ... [2019-10-22 08:59:46,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:46,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:46,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:46,774 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:46,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95e1beab-5236-4450-b09e-d9ace8579b84/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:59:46,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:46,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:59:46,832 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-10-22 08:59:46,832 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-10-22 08:59:46,832 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-10-22 08:59:46,832 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-10-22 08:59:46,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:46,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:46,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:46,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:47,090 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:47,090 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-22 08:59:47,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:47 BoogieIcfgContainer [2019-10-22 08:59:47,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:47,092 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:47,092 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:47,095 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:47,096 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:47,096 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:46" (1/3) ... [2019-10-22 08:59:47,102 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57e7de49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:47, skipping insertion in model container [2019-10-22 08:59:47,102 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:47,102 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:46" (2/3) ... [2019-10-22 08:59:47,103 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57e7de49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:47, skipping insertion in model container [2019-10-22 08:59:47,103 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:47,103 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:47" (3/3) ... [2019-10-22 08:59:47,104 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex5.i [2019-10-22 08:59:47,173 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:47,174 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:47,174 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:47,174 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:47,174 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:47,174 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:47,175 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:47,175 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:47,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-10-22 08:59:47,225 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:59:47,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:47,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:47,234 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:47,234 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:47,234 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:47,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-10-22 08:59:47,236 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:59:47,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:47,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:47,238 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:47,238 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:47,245 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 13#L63true assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 8#L63-2true assume !main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;havoc main_#t~short17;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 21#L66true call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 18#fENTRYtrue [2019-10-22 08:59:47,246 INFO L793 eck$LassoCheckResult]: Loop: 18#fENTRYtrue ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 11#L17true assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 19#L25true call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 15#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 3#L34true assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 4#gFINALtrue assume true; 7#gEXITtrue >#37#return; 22#L25-1true call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 18#fENTRYtrue [2019-10-22 08:59:47,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:47,254 INFO L82 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 1 times [2019-10-22 08:59:47,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:47,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526655543] [2019-10-22 08:59:47,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:47,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:47,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:47,423 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:47,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:47,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1513071857, now seen corresponding path program 1 times [2019-10-22 08:59:47,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:47,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578280283] [2019-10-22 08:59:47,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:47,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:47,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:47,560 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:59:47,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578280283] [2019-10-22 08:59:47,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:47,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:59:47,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697884988] [2019-10-22 08:59:47,565 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:59:47,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:47,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:59:47,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:59:47,586 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 6 states. [2019-10-22 08:59:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:47,737 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-10-22 08:59:47,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:59:47,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-10-22 08:59:47,743 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:59:47,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 17 states and 20 transitions. [2019-10-22 08:59:47,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 08:59:47,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:59:47,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2019-10-22 08:59:47,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:47,760 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 08:59:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2019-10-22 08:59:47,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-22 08:59:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:59:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-10-22 08:59:47,792 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 08:59:47,792 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 08:59:47,792 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:47,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-10-22 08:59:47,793 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:59:47,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:47,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:47,794 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:47,794 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:47,794 INFO L791 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 76#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 77#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 71#L63-2 assume !main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;havoc main_#t~short17;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 72#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 79#fENTRY [2019-10-22 08:59:47,794 INFO L793 eck$LassoCheckResult]: Loop: 79#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 74#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 65#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 69#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 64#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 66#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 69#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 64#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 67#gFINAL assume true; 68#gEXIT >#41#return; 70#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 73#gFINAL assume true; 80#gEXIT >#37#return; 75#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 79#fENTRY [2019-10-22 08:59:47,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:47,795 INFO L82 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 2 times [2019-10-22 08:59:47,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:47,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816341428] [2019-10-22 08:59:47,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:47,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:47,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:47,827 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:47,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:47,828 INFO L82 PathProgramCache]: Analyzing trace with hash 916774883, now seen corresponding path program 1 times [2019-10-22 08:59:47,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:47,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752966059] [2019-10-22 08:59:47,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:47,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:47,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:48,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:59:48,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752966059] [2019-10-22 08:59:48,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643383992] [2019-10-22 08:59:48,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95e1beab-5236-4450-b09e-d9ace8579b84/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:48,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-22 08:59:48,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:48,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-22 08:59:48,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:48,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:48,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:48,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-10-22 08:59:48,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:59:48,313 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:48,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-10-22 08:59:48,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512359582] [2019-10-22 08:59:48,314 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:59:48,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:48,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 08:59:48,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:59:48,315 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 15 states. [2019-10-22 08:59:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:48,536 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-10-22 08:59:48,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:59:48,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2019-10-22 08:59:48,538 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:59:48,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2019-10-22 08:59:48,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 08:59:48,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 08:59:48,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-10-22 08:59:48,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:48,539 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-22 08:59:48,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-10-22 08:59:48,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-22 08:59:48,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 08:59:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-10-22 08:59:48,542 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-22 08:59:48,542 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-22 08:59:48,542 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:48,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-10-22 08:59:48,543 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:59:48,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:48,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:48,544 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:48,544 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:48,544 INFO L791 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 191#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 185#L63-2 assume !main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;havoc main_#t~short17;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 186#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 193#fENTRY [2019-10-22 08:59:48,544 INFO L793 eck$LassoCheckResult]: Loop: 193#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 188#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 179#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 183#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 178#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 180#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 183#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 178#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 180#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 183#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 178#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 181#gFINAL assume true; 182#gEXIT >#41#return; 184#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 187#gFINAL assume true; 197#gEXIT >#41#return; 195#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 196#gFINAL assume true; 194#gEXIT >#37#return; 189#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 193#fENTRY [2019-10-22 08:59:48,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:48,545 INFO L82 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 3 times [2019-10-22 08:59:48,545 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:48,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007420129] [2019-10-22 08:59:48,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:48,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:48,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:48,574 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:48,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:48,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1267451407, now seen corresponding path program 2 times [2019-10-22 08:59:48,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:48,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639534569] [2019-10-22 08:59:48,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:48,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:48,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:48,654 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:48,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:48,654 INFO L82 PathProgramCache]: Analyzing trace with hash -2054594769, now seen corresponding path program 1 times [2019-10-22 08:59:48,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:48,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922174872] [2019-10-22 08:59:48,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:48,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:48,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:48,758 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:49,250 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2019-10-22 08:59:49,440 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-22 08:59:49,819 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 111 [2019-10-22 08:59:50,102 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-22 08:59:50,486 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 125 [2019-10-22 08:59:50,938 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-10-22 08:59:51,135 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:51,136 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:51,136 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:51,136 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:51,136 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:51,137 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:51,137 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:51,137 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:51,137 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5.i_Iteration3_Lasso [2019-10-22 08:59:51,137 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:51,137 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:51,154 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:59:51,162 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:59:51,164 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:59:51,165 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:59:51,167 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:59:51,169 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:59:51,170 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:59:51,172 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:59:51,177 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:59:51,180 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:59:51,182 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:59:51,183 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:59:51,185 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:59:51,187 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:59:51,190 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:59:51,323 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:59:51,325 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:59:51,326 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:59:51,327 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:59:51,329 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:59:51,330 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:59:51,331 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:59:51,332 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:59:51,333 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:59:51,335 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:59:51,336 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:59:51,337 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:59:51,339 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:59:51,340 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:59:51,341 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:59:51,344 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:59:51,346 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:59:51,350 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:59:51,351 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:59:51,352 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:59:51,353 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:59:51,354 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:59:51,355 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:59:51,356 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:59:51,785 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:59:51,858 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:51,862 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:51,864 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:59:51,866 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,866 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,867 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,867 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,869 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,869 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,871 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:59:51,872 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,872 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,872 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,872 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,872 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,873 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,873 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,874 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:59:51,875 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,875 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,875 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,875 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,875 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,876 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,876 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,877 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:59:51,878 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,878 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,878 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,878 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,878 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,879 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,879 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,880 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:59:51,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,880 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,882 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,882 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,883 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:59:51,883 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,883 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,884 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,884 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,884 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,884 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,886 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:59:51,886 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,886 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,887 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,887 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,887 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,887 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,887 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,888 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:59:51,889 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,889 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,890 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,890 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,890 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,891 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,891 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:59:51,892 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,892 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,892 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,892 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,895 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:51,895 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,897 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:59:51,898 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,898 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,898 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,898 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,899 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,899 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,899 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,900 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:59:51,901 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,901 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,901 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,902 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,902 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,902 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,902 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,903 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:59:51,904 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,904 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,904 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,904 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,905 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,905 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,905 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,906 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,906 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:59:51,907 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,907 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,907 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,908 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,908 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,908 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,908 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,909 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,910 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:59:51,910 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,910 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,911 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,911 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,918 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:51,918 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,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:59:51,922 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,922 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,922 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,922 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,924 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:51,924 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,940 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:59:51,943 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,943 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,943 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,943 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,945 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:51,945 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,955 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:51,967 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:59:51,968 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:59:51,970 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:51,972 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:51,973 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:51,974 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(f_#in~v) = 2*f_#in~v + 1 Supporting invariants [] [2019-10-22 08:59:51,991 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:59:52,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:52,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:52,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:52,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-22 08:59:52,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:52,137 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-22 08:59:52,140 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-10-22 08:59:52,140 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-10-22 08:59:52,221 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 63 states and 72 transitions. Complement of second has 15 states. [2019-10-22 08:59:52,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:59:52,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-10-22 08:59:52,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 20 letters. [2019-10-22 08:59:52,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:52,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 25 letters. Loop has 20 letters. [2019-10-22 08:59:52,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:52,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 40 letters. [2019-10-22 08:59:52,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:52,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 72 transitions. [2019-10-22 08:59:52,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:52,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 40 states and 47 transitions. [2019-10-22 08:59:52,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 08:59:52,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 08:59:52,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2019-10-22 08:59:52,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:52,232 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2019-10-22 08:59:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2019-10-22 08:59:52,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2019-10-22 08:59:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 08:59:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-10-22 08:59:52,235 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-10-22 08:59:52,235 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-10-22 08:59:52,235 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:59:52,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2019-10-22 08:59:52,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:52,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:52,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:52,237 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:52,237 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:52,237 INFO L791 eck$LassoCheckResult]: Stem: 397#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 395#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 396#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 388#L63-2 assume !main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;havoc main_#t~short17;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 389#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 398#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 391#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 378#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 385#gENTRY [2019-10-22 08:59:52,237 INFO L793 eck$LassoCheckResult]: Loop: 385#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 377#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 379#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 385#gENTRY [2019-10-22 08:59:52,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:52,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1845692449, now seen corresponding path program 1 times [2019-10-22 08:59:52,237 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:52,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415654197] [2019-10-22 08:59:52,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:52,258 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:52,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:52,258 INFO L82 PathProgramCache]: Analyzing trace with hash 38883, now seen corresponding path program 1 times [2019-10-22 08:59:52,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:52,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935107958] [2019-10-22 08:59:52,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:52,265 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:52,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:52,265 INFO L82 PathProgramCache]: Analyzing trace with hash -852415675, now seen corresponding path program 1 times [2019-10-22 08:59:52,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:52,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715218934] [2019-10-22 08:59:52,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:52,288 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:52,685 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-10-22 08:59:53,007 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 104 [2019-10-22 08:59:53,071 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:53,071 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:53,071 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:53,072 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:53,072 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:53,072 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:53,072 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:53,072 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:53,072 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5.i_Iteration4_Lasso [2019-10-22 08:59:53,072 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:53,072 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:53,077 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:59:53,080 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:59:53,081 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:59:53,082 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:59:53,083 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:59:53,084 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:59:53,086 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:59:53,087 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:59:53,088 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:59:53,089 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:59:53,091 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:59:53,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:59:53,228 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:59:53,234 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:59:53,235 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:59:53,237 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:59:53,238 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:59:53,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:59:53,244 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:59:53,246 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:59:53,247 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:59:53,248 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:59:53,253 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:59:53,254 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:59:53,255 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:59:53,262 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:59:53,264 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:59:53,265 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:59:53,267 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:59:53,269 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:59:53,271 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:59:53,272 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:59:53,274 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:59:53,275 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:59:53,277 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:59:53,278 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:59:53,280 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:59:53,281 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:59:53,282 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:59:53,284 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:59:53,285 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:59:53,287 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:59:53,288 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:59:53,290 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:59:53,291 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:59:53,292 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:59:53,294 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:59:53,295 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:59:53,297 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:59:53,298 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:59:53,300 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:59:53,301 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:59:53,302 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:59:53,304 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:59:53,305 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:59:53,306 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:59:53,567 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-10-22 08:59:53,613 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:53,613 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:53,614 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:59:53,614 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,614 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,615 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,615 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,615 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,615 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,615 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,616 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,616 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:59:53,616 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,616 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,617 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,617 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,617 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,617 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,617 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,618 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:59:53,618 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,618 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,619 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,619 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,619 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,619 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,619 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,620 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:59:53,620 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,620 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,620 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,620 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,620 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,620 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,621 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,621 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:59:53,622 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,622 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,622 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,622 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,622 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,623 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,623 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,623 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:59:53,624 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,624 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,624 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,624 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,624 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,624 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,625 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,625 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,625 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:59:53,626 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,626 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,626 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,626 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,626 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,626 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,626 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,627 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:59:53,628 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,628 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,628 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,628 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,628 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,628 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,628 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,629 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:59:53,630 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,630 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,630 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,630 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,630 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,630 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,631 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,631 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,631 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:59:53,632 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,632 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,632 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,632 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,633 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,633 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,635 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:59:53,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,635 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,636 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,636 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,637 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,637 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,640 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:59:53,640 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,641 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,641 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,641 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,642 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,642 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,653 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:53,657 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:59:53,657 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:59:53,658 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:53,658 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:53,659 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:53,659 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_1) = 2*v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_1 + 1 Supporting invariants [] [2019-10-22 08:59:53,662 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:59:53,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:59:53,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:53,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:53,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:53,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 08:59:53,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:53,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-10-22 08:59:53,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:53,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:53,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:53,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-10-22 08:59:53,746 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:59:53,746 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:59:53,746 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-10-22 08:59:53,792 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 57 states and 66 transitions. Complement of second has 15 states. [2019-10-22 08:59:53,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:53,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:59:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-10-22 08:59:53,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 8 letters. Loop has 3 letters. [2019-10-22 08:59:53,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:53,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 11 letters. Loop has 3 letters. [2019-10-22 08:59:53,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:53,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 8 letters. Loop has 6 letters. [2019-10-22 08:59:53,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:53,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2019-10-22 08:59:53,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:53,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 40 states and 48 transitions. [2019-10-22 08:59:53,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:59:53,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:59:53,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 48 transitions. [2019-10-22 08:59:53,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:53,797 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-10-22 08:59:53,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 48 transitions. [2019-10-22 08:59:53,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-22 08:59:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 08:59:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-10-22 08:59:53,802 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-10-22 08:59:53,802 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-10-22 08:59:53,802 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:59:53,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2019-10-22 08:59:53,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:53,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:53,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:53,804 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:53,804 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:53,804 INFO L791 eck$LassoCheckResult]: Stem: 559#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 557#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 558#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 551#L63-2 assume !main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;havoc main_#t~short17;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 552#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 561#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 556#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 540#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 560#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 539#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 541#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 573#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 570#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 543#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 573#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 569#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 542#gFINAL assume true; 544#gEXIT >#41#return; 550#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 553#gFINAL assume true; 568#gEXIT >#41#return; 567#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 566#gFINAL assume true; 564#gEXIT >#37#return; 555#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 562#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 554#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 538#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 545#gENTRY [2019-10-22 08:59:53,804 INFO L793 eck$LassoCheckResult]: Loop: 545#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 536#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 537#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 545#gENTRY [2019-10-22 08:59:53,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:53,805 INFO L82 PathProgramCache]: Analyzing trace with hash -853827823, now seen corresponding path program 2 times [2019-10-22 08:59:53,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:53,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186182320] [2019-10-22 08:59:53,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:53,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:53,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 08:59:53,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186182320] [2019-10-22 08:59:53,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988729765] [2019-10-22 08:59:53,979 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95e1beab-5236-4450-b09e-d9ace8579b84/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:54,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:59:54,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:59:54,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-22 08:59:54,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:54,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-22 08:59:54,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:54,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:54,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:54,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-10-22 08:59:54,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-10-22 08:59:54,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:54,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:54,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:54,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:3 [2019-10-22 08:59:54,227 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 08:59:54,227 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:54,228 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-10-22 08:59:54,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838867758] [2019-10-22 08:59:54,228 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:54,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:54,230 INFO L82 PathProgramCache]: Analyzing trace with hash 38883, now seen corresponding path program 2 times [2019-10-22 08:59:54,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:54,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852159654] [2019-10-22 08:59:54,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:54,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:54,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:54,236 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:54,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:54,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-22 08:59:54,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-10-22 08:59:54,345 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 12 Second operand 19 states. [2019-10-22 08:59:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:54,565 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-10-22 08:59:54,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:59:54,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2019-10-22 08:59:54,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:54,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 46 states and 58 transitions. [2019-10-22 08:59:54,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:59:54,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:59:54,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2019-10-22 08:59:54,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:54,569 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-10-22 08:59:54,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2019-10-22 08:59:54,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-10-22 08:59:54,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-22 08:59:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-10-22 08:59:54,574 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-10-22 08:59:54,574 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-10-22 08:59:54,574 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:59:54,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2019-10-22 08:59:54,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:54,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:54,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:54,576 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:54,576 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:54,576 INFO L791 eck$LassoCheckResult]: Stem: 795#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 793#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 794#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 786#L63-2 assume !main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;havoc main_#t~short17;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 787#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 799#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 800#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 797#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 796#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 798#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 777#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 784#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 810#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 776#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 784#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 810#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 776#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 784#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 775#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 778#gFINAL assume true; 813#gEXIT >#41#return; 788#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 779#gFINAL assume true; 782#gEXIT >#41#return; 785#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 812#gFINAL assume true; 805#gEXIT >#41#return; 804#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 803#gFINAL assume true; 802#gEXIT >#37#return; 790#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 801#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 789#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 773#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 783#gENTRY [2019-10-22 08:59:54,576 INFO L793 eck$LassoCheckResult]: Loop: 783#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 772#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 774#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 783#gENTRY [2019-10-22 08:59:54,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:54,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1079381827, now seen corresponding path program 3 times [2019-10-22 08:59:54,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:54,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942865251] [2019-10-22 08:59:54,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:54,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:54,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:54,641 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:54,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:54,641 INFO L82 PathProgramCache]: Analyzing trace with hash 38883, now seen corresponding path program 3 times [2019-10-22 08:59:54,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:54,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496520097] [2019-10-22 08:59:54,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:54,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:54,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:54,647 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:54,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:54,648 INFO L82 PathProgramCache]: Analyzing trace with hash 556146087, now seen corresponding path program 4 times [2019-10-22 08:59:54,648 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:54,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278640008] [2019-10-22 08:59:54,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:54,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:54,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:54,713 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:55,143 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2019-10-22 08:59:55,602 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 111 [2019-10-22 08:59:56,140 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 120 [2019-10-22 08:59:56,452 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-10-22 08:59:57,077 WARN L191 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 134 [2019-10-22 08:59:57,188 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-10-22 08:59:57,574 WARN L191 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 124 [2019-10-22 08:59:57,856 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-10-22 08:59:58,041 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-22 08:59:58,172 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-22 08:59:58,888 WARN L191 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 153 [2019-10-22 08:59:59,172 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-10-22 08:59:59,175 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:59,175 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:59,176 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:59,176 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:59,176 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:59,176 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:59,176 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:59,176 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:59,176 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5.i_Iteration6_Lasso [2019-10-22 08:59:59,176 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:59,176 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:59,180 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:59:59,185 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:59:59,190 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:59:59,192 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:59:59,194 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:59:59,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:59:59,437 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-10-22 08:59:59,495 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:59:59,497 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:59:59,498 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:59:59,499 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:59:59,500 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:59:59,501 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:59:59,502 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:59:59,503 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:59:59,504 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:59:59,505 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:59:59,506 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:59:59,507 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:59:59,508 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:59:59,509 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:59:59,510 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:59:59,511 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:59:59,515 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:59:59,516 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:59:59,517 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:59:59,518 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:59:59,519 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:59:59,520 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:59:59,522 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:59:59,523 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:59:59,524 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:59:59,525 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:59:59,526 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:59:59,534 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:59:59,539 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:59:59,540 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:59:59,541 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:59:59,542 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:59:59,543 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:59:59,544 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:59:59,545 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:59:59,549 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:59:59,550 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:59:59,552 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:59:59,553 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:59:59,556 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:59:59,557 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:59:59,558 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:59:59,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:59:59,565 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:59:59,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:59:59,567 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:59:59,568 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:59:59,569 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:59:59,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:59:59,571 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:59:59,730 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-10-22 09:00:15,508 WARN L191 SmtUtils]: Spent 15.67 s on a formula simplification. DAG size of input: 307 DAG size of output: 307 [2019-10-22 09:00:15,549 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:15,550 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:15,550 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 09:00:15,551 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:15,551 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:15,551 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:15,551 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:15,551 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:15,551 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:15,551 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:15,552 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:15,552 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 09:00:15,553 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:15,553 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:15,553 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:15,554 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:15,554 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:15,554 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:15,554 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:15,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:15,555 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 09:00:15,555 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:15,555 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:15,555 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:15,555 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:15,555 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:15,556 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:15,556 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:15,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:15,556 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 09:00:15,557 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:15,557 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:15,557 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:15,557 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:15,557 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:15,558 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:15,558 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:15,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:15,559 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 09:00:15,559 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:15,559 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:15,559 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:15,559 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:15,559 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:15,559 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:15,560 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:15,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:15,560 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 09:00:15,560 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:15,561 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:15,561 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:15,561 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:15,562 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:15,562 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:15,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:15,565 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 09:00:15,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:15,566 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:15,566 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:15,566 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:15,567 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:15,568 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:15,580 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:15,587 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:15,587 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:00:15,588 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:15,588 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:15,589 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:15,589 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_2) = 2*v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_2 + 1 Supporting invariants [] [2019-10-22 09:00:15,601 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-10-22 09:00:15,602 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:15,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:15,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 09:00:15,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:15,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:15,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:15,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:15,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 09:00:15,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:15,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-10-22 09:00:15,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:15,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:15,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:00:15,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-10-22 09:00:15,763 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 09:00:15,763 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-10-22 09:00:15,763 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-10-22 09:00:15,826 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 50 states and 59 transitions. Complement of second has 15 states. [2019-10-22 09:00:15,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:15,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:00:15,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2019-10-22 09:00:15,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 34 letters. Loop has 3 letters. [2019-10-22 09:00:15,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:15,830 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:15,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:15,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 09:00:15,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:15,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:15,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:15,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:15,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 09:00:15,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:15,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-10-22 09:00:15,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:15,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:15,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:00:15,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-10-22 09:00:15,966 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 09:00:15,966 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-10-22 09:00:15,966 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-10-22 09:00:16,021 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 50 states and 59 transitions. Complement of second has 15 states. [2019-10-22 09:00:16,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:00:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2019-10-22 09:00:16,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 34 letters. Loop has 3 letters. [2019-10-22 09:00:16,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:16,022 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:16,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:16,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 09:00:16,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:16,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:16,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:16,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:16,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 09:00:16,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:16,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-10-22 09:00:16,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:16,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:16,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:00:16,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-10-22 09:00:16,178 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 09:00:16,179 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-10-22 09:00:16,179 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-10-22 09:00:16,252 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 64 states and 73 transitions. Complement of second has 15 states. [2019-10-22 09:00:16,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:00:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2019-10-22 09:00:16,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 3 letters. [2019-10-22 09:00:16,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:16,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 37 letters. Loop has 3 letters. [2019-10-22 09:00:16,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:16,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 6 letters. [2019-10-22 09:00:16,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:16,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 73 transitions. [2019-10-22 09:00:16,256 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:16,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2019-10-22 09:00:16,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:00:16,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:00:16,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:00:16,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:16,256 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:16,256 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:16,256 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:16,256 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:00:16,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:00:16,257 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:16,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:00:16,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:00:16 BoogieIcfgContainer [2019-10-22 09:00:16,262 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:00:16,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:16,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:16,262 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:16,262 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:47" (3/4) ... [2019-10-22 09:00:16,265 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:00:16,265 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:16,266 INFO L168 Benchmark]: Toolchain (without parser) took 29878.84 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 513.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -136.2 MB). Peak memory consumption was 377.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:16,266 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:16,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -185.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:16,267 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.32 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 09:00:16,267 INFO L168 Benchmark]: Boogie Preprocessor took 19.24 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 09:00:16,267 INFO L168 Benchmark]: RCFGBuilder took 317.76 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:16,269 INFO L168 Benchmark]: BuchiAutomizer took 29169.74 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 376.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 402.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:16,270 INFO L168 Benchmark]: Witness Printer took 3.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:16,272 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 334.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -185.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.24 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 317.76 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 29169.74 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 376.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 402.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * \old(v) + 1 and consists of 5 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.1s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 27.2s. Construction of modules took 0.3s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 14/14 HoareTripleCheckerStatistics: 115 SDtfs, 87 SDslu, 248 SDs, 0 SdLazy, 344 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital356 mio100 ax100 hnf100 lsp97 ukn38 mio100 lsp34 div100 bol100 ite100 ukn100 eq166 hnf96 smp100 dnf5460 smp82 tf100 neg83 sie162 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...