./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.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_7c7da072-b62b-4dce-a182-883b326b5f1c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7c7da072-b62b-4dce-a182-883b326b5f1c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7c7da072-b62b-4dce-a182-883b326b5f1c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7c7da072-b62b-4dce-a182-883b326b5f1c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7c7da072-b62b-4dce-a182-883b326b5f1c/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7c7da072-b62b-4dce-a182-883b326b5f1c/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 0c73140129db08253eb2666e014a272764010e16 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:05,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:05,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:05,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:05,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:05,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:05,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:05,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:05,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:05,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:05,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:05,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:05,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:05,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:05,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:05,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:05,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:05,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:05,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:05,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:05,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:05,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:05,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:05,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:05,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:05,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:05,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:05,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:05,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:05,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:05,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:05,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:05,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:05,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:05,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:05,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:05,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:05,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:05,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:05,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:05,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:05,792 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7c7da072-b62b-4dce-a182-883b326b5f1c/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:59:05,810 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:05,810 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:05,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:05,823 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:05,823 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:05,823 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:05,823 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:05,823 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:05,823 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:05,823 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:05,824 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:05,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:05,824 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:05,824 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:05,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:05,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:05,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:05,825 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:05,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:05,825 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:05,825 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:05,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:05,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:05,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:05,826 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:05,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:05,826 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:05,826 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:05,827 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:05,827 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_7c7da072-b62b-4dce-a182-883b326b5f1c/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 -> 0c73140129db08253eb2666e014a272764010e16 [2019-10-22 08:59:05,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:05,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:05,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:05,876 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:05,877 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:05,877 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7c7da072-b62b-4dce-a182-883b326b5f1c/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.i [2019-10-22 08:59:05,930 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7c7da072-b62b-4dce-a182-883b326b5f1c/bin/uautomizer/data/fbb02aa4c/0e4db9774ff249aabca1bfdb93fc2b78/FLAG299aebf72 [2019-10-22 08:59:06,372 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:06,373 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7c7da072-b62b-4dce-a182-883b326b5f1c/sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.i [2019-10-22 08:59:06,388 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7c7da072-b62b-4dce-a182-883b326b5f1c/bin/uautomizer/data/fbb02aa4c/0e4db9774ff249aabca1bfdb93fc2b78/FLAG299aebf72 [2019-10-22 08:59:06,672 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7c7da072-b62b-4dce-a182-883b326b5f1c/bin/uautomizer/data/fbb02aa4c/0e4db9774ff249aabca1bfdb93fc2b78 [2019-10-22 08:59:06,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:06,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:06,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:06,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:06,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:06,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d7e3efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06, skipping insertion in model container [2019-10-22 08:59:06,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,694 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:06,735 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:07,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:07,098 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:07,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:07,202 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:07,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07 WrapperNode [2019-10-22 08:59:07,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:07,204 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:07,204 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:07,204 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:07,212 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:07" (1/1) ... [2019-10-22 08:59:07,228 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:07" (1/1) ... [2019-10-22 08:59:07,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:07,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:07,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:07,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:07,267 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:07" (1/1) ... [2019-10-22 08:59:07,267 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:07" (1/1) ... [2019-10-22 08:59:07,270 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:07" (1/1) ... [2019-10-22 08:59:07,275 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:07" (1/1) ... [2019-10-22 08:59:07,285 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:07" (1/1) ... [2019-10-22 08:59:07,299 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:07" (1/1) ... [2019-10-22 08:59:07,300 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:07" (1/1) ... [2019-10-22 08:59:07,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:07,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:07,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:07,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:07,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c7da072-b62b-4dce-a182-883b326b5f1c/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:07,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:07,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:07,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:07,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:07,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:07,791 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:07,791 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:59:07,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:07 BoogieIcfgContainer [2019-10-22 08:59:07,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:07,793 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:07,793 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:07,797 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:07,798 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:07,798 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:06" (1/3) ... [2019-10-22 08:59:07,799 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12fe5d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:07, skipping insertion in model container [2019-10-22 08:59:07,799 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:07,799 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (2/3) ... [2019-10-22 08:59:07,800 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12fe5d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:07, skipping insertion in model container [2019-10-22 08:59:07,800 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:07,800 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:07" (3/3) ... [2019-10-22 08:59:07,801 INFO L371 chiAutomizerObserver]: Analyzing ICFG diff-alloca-1.i [2019-10-22 08:59:07,846 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:07,846 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:07,847 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:07,847 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:07,847 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:07,847 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:07,847 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:07,847 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:07,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 08:59:07,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:59:07,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:07,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:07,889 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:07,889 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:07,889 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:07,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 08:59:07,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:59:07,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:07,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:07,891 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:07,891 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:07,899 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 9#L574true assume !(main_~Alen~0 < 1); 14#L574-2true assume !(main_~Blen~0 < 1); 7#L577-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 12#L554-2true [2019-10-22 08:59:07,899 INFO L793 eck$LassoCheckResult]: Loop: 12#L554-2true assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 5#L558-2true assume !true; 6#L557-2true assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 11#L564-1true diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 12#L554-2true [2019-10-22 08:59:07,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:07,905 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:59:07,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:07,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849755206] [2019-10-22 08:59:07,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,065 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:08,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1679350, now seen corresponding path program 1 times [2019-10-22 08:59:08,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581165044] [2019-10-22 08:59:08,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:08,098 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:08,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581165044] [2019-10-22 08:59:08,099 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:08,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:08,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542531820] [2019-10-22 08:59:08,104 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:59:08,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:08,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:59:08,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:59:08,119 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-10-22 08:59:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:08,125 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-10-22 08:59:08,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:59:08,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-10-22 08:59:08,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:59:08,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 15 transitions. [2019-10-22 08:59:08,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:59:08,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:59:08,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2019-10-22 08:59:08,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:08,135 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-10-22 08:59:08,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2019-10-22 08:59:08,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-10-22 08:59:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 08:59:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2019-10-22 08:59:08,159 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-10-22 08:59:08,159 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-10-22 08:59:08,159 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:08,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2019-10-22 08:59:08,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:59:08,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:08,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:08,161 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:08,161 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:08,161 INFO L791 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 37#L574 assume !(main_~Alen~0 < 1); 38#L574-2 assume !(main_~Blen~0 < 1); 44#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 42#L554-2 [2019-10-22 08:59:08,161 INFO L793 eck$LassoCheckResult]: Loop: 42#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 40#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 45#L557-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 41#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 42#L554-2 [2019-10-22 08:59:08,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,162 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-10-22 08:59:08,162 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581589084] [2019-10-22 08:59:08,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,203 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:08,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1669740, now seen corresponding path program 1 times [2019-10-22 08:59:08,204 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319636146] [2019-10-22 08:59:08,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,226 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:08,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1298476337, now seen corresponding path program 1 times [2019-10-22 08:59:08,227 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120625604] [2019-10-22 08:59:08,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:08,335 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:08,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120625604] [2019-10-22 08:59:08,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:08,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:08,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713278619] [2019-10-22 08:59:08,487 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-10-22 08:59:08,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:08,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:59:08,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:59:08,536 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-10-22 08:59:08,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:08,596 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2019-10-22 08:59:08,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:59:08,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2019-10-22 08:59:08,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:59:08,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 18 transitions. [2019-10-22 08:59:08,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:59:08,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:59:08,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2019-10-22 08:59:08,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:08,601 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2019-10-22 08:59:08,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2019-10-22 08:59:08,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-10-22 08:59:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:59:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-10-22 08:59:08,608 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-10-22 08:59:08,608 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-10-22 08:59:08,608 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:08,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-10-22 08:59:08,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:08,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:08,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:08,609 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:08,610 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:08,610 INFO L791 eck$LassoCheckResult]: Stem: 79#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 73#L574 assume !(main_~Alen~0 < 1); 76#L574-2 assume !(main_~Blen~0 < 1); 81#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 78#L554-2 [2019-10-22 08:59:08,610 INFO L793 eck$LassoCheckResult]: Loop: 78#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 80#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 74#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 75#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 82#L557-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 77#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 78#L554-2 [2019-10-22 08:59:08,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,610 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2019-10-22 08:59:08,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252152433] [2019-10-22 08:59:08,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,647 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:08,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183209, now seen corresponding path program 1 times [2019-10-22 08:59:08,648 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51124878] [2019-10-22 08:59:08,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:08,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:08,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51124878] [2019-10-22 08:59:08,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:08,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:59:08,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240231549] [2019-10-22 08:59:08,690 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:59:08,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:08,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:08,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:08,691 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-10-22 08:59:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:08,722 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-10-22 08:59:08,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:08,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-10-22 08:59:08,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-10-22 08:59:08,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2019-10-22 08:59:08,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 08:59:08,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:59:08,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-10-22 08:59:08,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:08,725 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-10-22 08:59:08,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-10-22 08:59:08,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2019-10-22 08:59:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:59:08,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-10-22 08:59:08,727 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-10-22 08:59:08,727 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-10-22 08:59:08,728 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:59:08,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-10-22 08:59:08,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:59:08,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:08,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:08,729 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:08,729 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:08,729 INFO L791 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 107#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 108#L574 assume !(main_~Alen~0 < 1); 112#L574-2 assume !(main_~Blen~0 < 1); 118#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 114#L554-2 [2019-10-22 08:59:08,729 INFO L793 eck$LassoCheckResult]: Loop: 114#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 116#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 109#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 110#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 117#L557-2 assume !(0 == diff_~found~0); 113#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 114#L554-2 [2019-10-22 08:59:08,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,730 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2019-10-22 08:59:08,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983805262] [2019-10-22 08:59:08,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,766 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:08,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183271, now seen corresponding path program 1 times [2019-10-22 08:59:08,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203712010] [2019-10-22 08:59:08,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,794 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:08,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1998160148, now seen corresponding path program 1 times [2019-10-22 08:59:08,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312023200] [2019-10-22 08:59:08,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,885 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:08,994 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-22 08:59:09,250 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-10-22 08:59:09,454 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-10-22 08:59:09,468 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:09,469 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:09,469 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:09,469 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:09,469 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:09,469 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:09,470 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:09,470 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:09,470 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration4_Lasso [2019-10-22 08:59:09,470 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:09,470 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:09,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:09,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:09,521 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:09,530 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:09,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:09,547 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:09,551 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:09,555 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:09,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:09,562 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:09,564 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:09,977 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2019-10-22 08:59:10,038 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:10,040 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:10,041 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:10,043 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:10,045 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:10,047 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:10,052 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:11,063 WARN L191 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-10-22 08:59:11,228 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:11,233 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:11,234 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:11,235 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,236 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:11,236 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,236 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,236 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,238 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:11,238 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:11,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,240 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:11,241 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,241 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:11,241 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,241 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,241 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,242 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:11,242 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:11,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,242 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:11,243 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,243 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,243 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,243 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,245 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:11,246 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:11,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,249 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:11,249 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,249 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,249 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,249 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,251 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:11,251 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:11,253 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,254 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:11,254 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,254 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,254 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,255 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,256 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:11,256 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:11,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,260 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:11,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,261 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:11,261 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,261 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,261 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,262 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:11,262 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:11,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,263 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:11,263 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,264 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,264 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,264 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,265 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:11,266 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:11,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,268 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:11,268 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,269 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:11,269 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,269 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,269 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,269 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:11,269 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:11,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,270 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:11,271 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,271 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:11,271 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,271 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,271 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,272 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:11,272 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:11,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,274 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:11,275 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,275 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:11,275 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,275 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,275 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,276 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:11,276 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:11,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,277 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:11,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,278 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-10-22 08:59:11,278 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,278 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,288 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-10-22 08:59:11,289 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:11,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,351 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:11,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,352 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,352 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,352 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,353 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:11,353 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:11,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,356 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:11,356 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,356 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,356 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,356 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,357 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:11,357 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:11,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,360 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:11,361 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,361 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,361 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,361 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,363 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:11,363 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:11,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,369 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:11,370 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,370 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,370 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,370 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,373 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:11,373 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:11,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,387 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:11,388 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,388 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:11,388 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,388 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,388 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,389 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:11,389 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:11,390 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,390 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:11,391 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,391 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,391 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,391 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,392 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:11,393 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:11,398 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,398 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:11,399 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,399 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,399 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,399 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,402 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:11,402 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:11,449 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:11,484 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:59:11,484 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:59:11,486 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:11,488 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:11,489 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:11,489 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0) = -1*ULTIMATE.start_diff_~i~0 + 1*ULTIMATE.start_diff_~l1~0 Supporting invariants [] [2019-10-22 08:59:11,548 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-10-22 08:59:11,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:11,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:11,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:11,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:11,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:59:11,641 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:59:11,642 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 08:59:11,684 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 30 transitions. Complement of second has 4 states. [2019-10-22 08:59:11,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:11,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-10-22 08:59:11,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 6 letters. [2019-10-22 08:59:11,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:11,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2019-10-22 08:59:11,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:11,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 12 letters. [2019-10-22 08:59:11,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:11,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2019-10-22 08:59:11,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:59:11,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 24 transitions. [2019-10-22 08:59:11,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:59:11,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:59:11,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-10-22 08:59:11,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:11,694 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 08:59:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-10-22 08:59:11,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-10-22 08:59:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 08:59:11,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2019-10-22 08:59:11,696 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-10-22 08:59:11,696 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-10-22 08:59:11,696 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:59:11,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2019-10-22 08:59:11,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:59:11,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:11,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:11,697 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:11,697 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:11,698 INFO L791 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 254#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 255#L574 assume !(main_~Alen~0 < 1); 256#L574-2 assume !(main_~Blen~0 < 1); 267#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 265#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 258#L558-2 [2019-10-22 08:59:11,698 INFO L793 eck$LassoCheckResult]: Loop: 258#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 257#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 258#L558-2 [2019-10-22 08:59:11,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,698 INFO L82 PathProgramCache]: Analyzing trace with hash 889572242, now seen corresponding path program 1 times [2019-10-22 08:59:11,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292563869] [2019-10-22 08:59:11,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,741 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:11,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,746 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2019-10-22 08:59:11,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563006604] [2019-10-22 08:59:11,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,756 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:11,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,757 INFO L82 PathProgramCache]: Analyzing trace with hash 180433719, now seen corresponding path program 1 times [2019-10-22 08:59:11,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798826060] [2019-10-22 08:59:11,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,790 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:12,257 WARN L191 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 115 [2019-10-22 08:59:12,460 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-10-22 08:59:12,463 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:12,463 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:12,463 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:12,463 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:12,464 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:12,464 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:12,464 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:12,464 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:12,464 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration5_Lasso [2019-10-22 08:59:12,464 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:12,464 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:12,474 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:12,481 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:12,482 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:12,486 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:12,488 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:12,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:12,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:12,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:12,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:12,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:12,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:12,789 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 99 [2019-10-22 08:59:12,822 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:12,823 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:12,825 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:12,826 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:12,831 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:12,832 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:12,835 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:13,803 WARN L191 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-10-22 08:59:13,853 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:13,853 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:13,854 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:13,854 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:13,855 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:13,855 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:13,855 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:13,858 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:13,859 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:13,861 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:13,861 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:13,861 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:13,862 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:13,862 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:13,862 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:13,862 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:13,862 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:13,863 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:13,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:13,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:13,864 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:13,864 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:13,864 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:13,864 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:13,865 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:13,865 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:13,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:13,867 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:13,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:13,868 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:13,868 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:13,868 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:13,868 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:13,869 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:13,869 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:13,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:13,870 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:13,870 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:13,870 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:13,871 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:13,871 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:13,871 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:13,871 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:13,872 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:13,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:13,873 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:13,873 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:13,873 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:13,873 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:13,873 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:13,874 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:13,875 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:13,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:13,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:13,878 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:13,878 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:13,878 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:13,878 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:13,878 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:13,879 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:13,879 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:13,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:13,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:13,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:13,880 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:13,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:13,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:13,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:13,881 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:13,881 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:13,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:13,882 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:13,883 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:13,883 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:13,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:13,884 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:13,884 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:13,885 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:13,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:13,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:13,887 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:13,887 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:13,887 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:13,887 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:13,888 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:13,888 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:13,888 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:13,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:13,889 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:13,889 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:13,890 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:13,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:13,890 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:13,895 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:13,895 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:13,942 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:14,018 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:59:14,019 INFO L444 ModelExtractionUtils]: 66 out of 73 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:59:14,019 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:14,020 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:14,023 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:14,023 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0) = 1*ULTIMATE.start_diff_~l2~0 - 1*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2019-10-22 08:59:14,062 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-10-22 08:59:14,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:14,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:14,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:14,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:14,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:14,116 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:14,117 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:59:14,117 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 08:59:14,139 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 38 states and 53 transitions. Complement of second has 7 states. [2019-10-22 08:59:14,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-10-22 08:59:14,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 08:59:14,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:14,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 2 letters. [2019-10-22 08:59:14,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:14,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:59:14,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:14,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2019-10-22 08:59:14,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:59:14,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 39 transitions. [2019-10-22 08:59:14,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:59:14,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:59:14,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 39 transitions. [2019-10-22 08:59:14,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:14,146 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2019-10-22 08:59:14,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 39 transitions. [2019-10-22 08:59:14,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-10-22 08:59:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 08:59:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-10-22 08:59:14,148 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-10-22 08:59:14,148 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-10-22 08:59:14,148 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:59:14,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-10-22 08:59:14,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:59:14,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:14,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:14,150 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:14,150 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:14,150 INFO L791 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 416#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 417#L574 assume !(main_~Alen~0 < 1); 422#L574-2 assume !(main_~Blen~0 < 1); 430#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 426#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 427#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 434#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 435#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 432#L557-2 assume !(0 == diff_~found~0); 423#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 424#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 419#L558-2 [2019-10-22 08:59:14,150 INFO L793 eck$LassoCheckResult]: Loop: 419#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 418#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 419#L558-2 [2019-10-22 08:59:14,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:14,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1811575378, now seen corresponding path program 1 times [2019-10-22 08:59:14,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:14,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27185792] [2019-10-22 08:59:14,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:59:14,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27185792] [2019-10-22 08:59:14,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:14,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:14,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253032242] [2019-10-22 08:59:14,195 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:14,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2019-10-22 08:59:14,195 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:14,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734710894] [2019-10-22 08:59:14,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:14,204 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:14,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:14,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:14,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:14,265 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-10-22 08:59:14,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:14,276 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2019-10-22 08:59:14,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:14,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2019-10-22 08:59:14,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:59:14,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 31 transitions. [2019-10-22 08:59:14,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:59:14,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:59:14,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2019-10-22 08:59:14,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:14,278 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-10-22 08:59:14,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2019-10-22 08:59:14,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-10-22 08:59:14,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 08:59:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-10-22 08:59:14,279 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-10-22 08:59:14,279 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-10-22 08:59:14,279 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:59:14,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2019-10-22 08:59:14,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:59:14,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:14,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:14,280 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:14,280 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:14,280 INFO L791 eck$LassoCheckResult]: Stem: 473#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 464#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 465#L574 assume !(main_~Alen~0 < 1); 470#L574-2 assume !(main_~Blen~0 < 1); 478#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 474#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 475#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 483#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 481#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 479#L557-2 assume !(0 == diff_~found~0); 471#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 472#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 467#L558-2 [2019-10-22 08:59:14,280 INFO L793 eck$LassoCheckResult]: Loop: 467#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 466#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 467#L558-2 [2019-10-22 08:59:14,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:14,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1813422420, now seen corresponding path program 2 times [2019-10-22 08:59:14,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:14,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621977687] [2019-10-22 08:59:14,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:14,299 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:14,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:14,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 3 times [2019-10-22 08:59:14,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:14,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916180920] [2019-10-22 08:59:14,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:14,305 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:14,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:14,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1057777617, now seen corresponding path program 1 times [2019-10-22 08:59:14,306 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:14,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204929726] [2019-10-22 08:59:14,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:14,323 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:14,977 WARN L191 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 137 [2019-10-22 08:59:15,189 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-10-22 08:59:15,191 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:15,191 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:15,191 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:15,191 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:15,192 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:15,192 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:15,192 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:15,192 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:15,192 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration7_Lasso [2019-10-22 08:59:15,192 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:15,192 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:15,197 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:15,199 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:15,201 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:15,582 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 102 [2019-10-22 08:59:15,616 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:15,617 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:15,619 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:15,620 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:15,622 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:15,623 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:15,625 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:15,626 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:15,631 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:15,632 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:15,634 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:15,636 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:15,638 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:15,639 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:15,640 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:16,513 WARN L191 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-10-22 08:59:16,637 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:16,637 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:16,637 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:16,638 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:16,638 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:16,638 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:16,638 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:16,638 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:16,639 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:16,639 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:16,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:16,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:16,640 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:16,641 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:16,641 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:16,641 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:16,641 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:16,641 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:16,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:16,643 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:16,644 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:16,644 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:16,644 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:16,644 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:16,645 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:16,645 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:16,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:16,647 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:16,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:16,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:16,647 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:59:16,647 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:16,649 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-10-22 08:59:16,649 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:59:16,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:16,658 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:16,658 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:16,658 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:16,658 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:16,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:16,659 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:16,660 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:16,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:16,663 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:16,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:16,663 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:16,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:16,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:16,664 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:16,664 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:16,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:16,665 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:16,666 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:16,666 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:16,666 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:16,666 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:16,667 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:16,667 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:16,668 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:16,669 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:16,669 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:16,669 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-10-22 08:59:16,669 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:16,669 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:16,674 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-10-22 08:59:16,674 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:16,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:16,699 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:16,699 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:16,700 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:16,700 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:16,700 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:16,700 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:16,701 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:16,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:16,704 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:16,704 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:16,704 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:16,705 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:16,705 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:16,708 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:16,708 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:16,758 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:16,827 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 08:59:16,827 INFO L444 ModelExtractionUtils]: 57 out of 64 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:59:16,828 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:16,828 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:16,829 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:16,829 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0) = 1*ULTIMATE.start_diff_~l2~0 - 1*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2019-10-22 08:59:16,872 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2019-10-22 08:59:16,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:16,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:16,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:16,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:16,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:16,915 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:16,915 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:59:16,915 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:59:16,930 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 36 states and 48 transitions. Complement of second has 7 states. [2019-10-22 08:59:16,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-10-22 08:59:16,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2019-10-22 08:59:16,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:16,931 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:59:16,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:16,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:16,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:16,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:16,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:16,978 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:16,979 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:59:16,979 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:59:16,991 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 36 states and 48 transitions. Complement of second has 7 states. [2019-10-22 08:59:16,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:16,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:16,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-10-22 08:59:16,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2019-10-22 08:59:16,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:16,992 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:59:17,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:17,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:17,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:17,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:17,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:17,044 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:17,044 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:59:17,044 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:59:17,064 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 34 states and 49 transitions. Complement of second has 6 states. [2019-10-22 08:59:17,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:17,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:17,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2019-10-22 08:59:17,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 12 letters. Loop has 2 letters. [2019-10-22 08:59:17,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:17,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 14 letters. Loop has 2 letters. [2019-10-22 08:59:17,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:17,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 12 letters. Loop has 4 letters. [2019-10-22 08:59:17,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:17,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 49 transitions. [2019-10-22 08:59:17,067 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:17,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2019-10-22 08:59:17,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:59:17,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:59:17,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:59:17,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:17,068 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:17,068 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:17,068 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:17,068 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:59:17,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:17,068 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:17,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:59:17,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:59:17 BoogieIcfgContainer [2019-10-22 08:59:17,074 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:59:17,074 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:17,074 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:17,074 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:17,075 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:07" (3/4) ... [2019-10-22 08:59:17,077 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:59:17,077 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:17,079 INFO L168 Benchmark]: Toolchain (without parser) took 10403.14 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 376.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 181.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:17,079 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:17,080 INFO L168 Benchmark]: CACSL2BoogieTranslator took 526.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:17,080 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:17,080 INFO L168 Benchmark]: Boogie Preprocessor took 46.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:17,080 INFO L168 Benchmark]: RCFGBuilder took 488.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:17,081 INFO L168 Benchmark]: BuchiAutomizer took 9280.91 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -61.2 MB). Peak memory consumption was 189.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:17,081 INFO L168 Benchmark]: Witness Printer took 3.48 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:17,083 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 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 526.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.86 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 488.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9280.91 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -61.2 MB). Peak memory consumption was 189.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.48 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + l1 and consists of 3 locations. One deterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.2s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 8.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 127 SDtfs, 117 SDslu, 59 SDs, 0 SdLazy, 73 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital273 mio100 ax106 hnf99 lsp84 ukn88 mio100 lsp48 div100 bol100 ite100 ukn100 eq185 hnf89 smp100 dnf382 smp95 tf100 neg95 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 73ms VariablesStem: 13 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...