./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ca64e3ea-400e-4042-bcee-5a130b701543/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ca64e3ea-400e-4042-bcee-5a130b701543/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ca64e3ea-400e-4042-bcee-5a130b701543/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ca64e3ea-400e-4042-bcee-5a130b701543/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ca64e3ea-400e-4042-bcee-5a130b701543/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ca64e3ea-400e-4042-bcee-5a130b701543/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 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.23-1dbac8b [2018-11-10 04:27:31,798 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:27:31,799 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:27:31,806 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:27:31,806 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:27:31,807 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:27:31,808 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:27:31,809 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:27:31,810 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:27:31,811 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:27:31,811 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:27:31,811 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:27:31,812 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:27:31,813 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:27:31,813 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:27:31,814 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:27:31,815 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:27:31,816 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:27:31,817 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:27:31,818 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:27:31,819 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:27:31,820 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:27:31,821 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:27:31,821 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:27:31,822 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:27:31,822 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:27:31,823 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:27:31,824 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:27:31,824 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:27:31,825 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:27:31,825 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:27:31,825 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:27:31,826 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:27:31,826 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:27:31,826 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:27:31,827 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:27:31,827 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ca64e3ea-400e-4042-bcee-5a130b701543/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 04:27:31,838 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:27:31,838 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:27:31,839 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:27:31,839 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:27:31,839 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:27:31,840 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:27:31,840 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:27:31,840 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:27:31,840 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:27:31,841 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:27:31,841 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:27:31,841 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:27:31,841 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:27:31,841 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:27:31,841 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:27:31,841 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:27:31,841 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:27:31,841 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:27:31,842 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:27:31,842 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:27:31,842 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:27:31,842 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:27:31,842 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:27:31,842 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:27:31,842 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:27:31,842 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:27:31,842 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:27:31,843 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:27:31,843 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ca64e3ea-400e-4042-bcee-5a130b701543/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0c73140129db08253eb2666e014a272764010e16 [2018-11-10 04:27:31,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:27:31,878 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:27:31,881 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:27:31,882 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:27:31,882 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:27:31,883 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ca64e3ea-400e-4042-bcee-5a130b701543/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i [2018-11-10 04:27:31,926 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ca64e3ea-400e-4042-bcee-5a130b701543/bin-2019/uautomizer/data/041f2715c/3ddb39a926414a8da8720ada3656541c/FLAGd7405db16 [2018-11-10 04:27:32,359 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:27:32,360 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ca64e3ea-400e-4042-bcee-5a130b701543/sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i [2018-11-10 04:27:32,367 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ca64e3ea-400e-4042-bcee-5a130b701543/bin-2019/uautomizer/data/041f2715c/3ddb39a926414a8da8720ada3656541c/FLAGd7405db16 [2018-11-10 04:27:32,380 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ca64e3ea-400e-4042-bcee-5a130b701543/bin-2019/uautomizer/data/041f2715c/3ddb39a926414a8da8720ada3656541c [2018-11-10 04:27:32,383 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:27:32,384 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:27:32,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:27:32,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:27:32,388 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:27:32,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:27:32" (1/1) ... [2018-11-10 04:27:32,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff1ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:32, skipping insertion in model container [2018-11-10 04:27:32,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:27:32" (1/1) ... [2018-11-10 04:27:32,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:27:32,429 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:27:32,632 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:27:32,639 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:27:32,665 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:27:32,697 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:27:32,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:32 WrapperNode [2018-11-10 04:27:32,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:27:32,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:27:32,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:27:32,699 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:27:32,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:32" (1/1) ... [2018-11-10 04:27:32,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:32" (1/1) ... [2018-11-10 04:27:32,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:27:32,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:27:32,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:27:32,771 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:27:32,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:32" (1/1) ... [2018-11-10 04:27:32,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:32" (1/1) ... [2018-11-10 04:27:32,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:32" (1/1) ... [2018-11-10 04:27:32,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:32" (1/1) ... [2018-11-10 04:27:32,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:32" (1/1) ... [2018-11-10 04:27:32,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:32" (1/1) ... [2018-11-10 04:27:32,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:32" (1/1) ... [2018-11-10 04:27:32,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:27:32,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:27:32,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:27:32,787 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:27:32,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ca64e3ea-400e-4042-bcee-5a130b701543/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:27:32,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 04:27:32,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 04:27:32,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:27:32,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:27:32,998 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:27:32,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:27:32 BoogieIcfgContainer [2018-11-10 04:27:32,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:27:32,999 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:27:32,999 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:27:33,003 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:27:33,003 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:27:33,004 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:27:32" (1/3) ... [2018-11-10 04:27:33,005 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2db830a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:27:33, skipping insertion in model container [2018-11-10 04:27:33,005 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:27:33,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:32" (2/3) ... [2018-11-10 04:27:33,006 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2db830a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:27:33, skipping insertion in model container [2018-11-10 04:27:33,006 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:27:33,006 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:27:32" (3/3) ... [2018-11-10 04:27:33,007 INFO L375 chiAutomizerObserver]: Analyzing ICFG diff-alloca_true-termination.c.i [2018-11-10 04:27:33,042 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:27:33,042 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:27:33,042 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:27:33,042 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:27:33,042 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:27:33,042 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:27:33,042 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:27:33,043 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:27:33,043 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:27:33,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-10 04:27:33,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 04:27:33,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:27:33,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:27:33,071 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 04:27:33,071 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:27:33,072 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:27:33,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-10 04:27:33,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 04:27:33,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:27:33,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:27:33,073 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 04:27:33,074 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:27:33,079 INFO L793 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 15#L574true assume !(main_~Alen~0 < 1); 21#L574-2true assume !(main_~Blen~0 < 1); 8#L577-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;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; 20#L554-3true [2018-11-10 04:27:33,079 INFO L795 eck$LassoCheckResult]: Loop: 20#L554-3true assume true; 14#L554-1true assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 10#L558-4true assume !true; 11#L557-3true assume !(diff_~found~0 == 0); 17#L564-1true diff_#t~post7 := diff_~i~0;diff_~i~0 := diff_#t~post7 + 1;havoc diff_#t~post7; 20#L554-3true [2018-11-10 04:27:33,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:33,083 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-10 04:27:33,085 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:33,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:33,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:27:33,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:33,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:33,174 INFO L82 PathProgramCache]: Analyzing trace with hash 46965800, now seen corresponding path program 1 times [2018-11-10 04:27:33,174 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:33,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:33,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:27:33,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:27:33,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:27:33,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 04:27:33,199 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:27:33,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 04:27:33,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 04:27:33,210 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-10 04:27:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:27:33,216 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-11-10 04:27:33,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 04:27:33,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2018-11-10 04:27:33,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 04:27:33,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 22 transitions. [2018-11-10 04:27:33,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 04:27:33,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-10 04:27:33,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-11-10 04:27:33,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:27:33,221 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-10 04:27:33,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-11-10 04:27:33,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-10 04:27:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 04:27:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-11-10 04:27:33,242 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-10 04:27:33,243 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-10 04:27:33,243 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:27:33,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2018-11-10 04:27:33,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 04:27:33,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:27:33,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:27:33,244 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 04:27:33,244 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:27:33,244 INFO L793 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 63#L574 assume !(main_~Alen~0 < 1); 65#L574-2 assume !(main_~Blen~0 < 1); 56#L577-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;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; 57#L554-3 [2018-11-10 04:27:33,244 INFO L795 eck$LassoCheckResult]: Loop: 57#L554-3 assume true; 64#L554-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 55#L558-4 assume true; 53#L557-1 assume !(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 54#L557-3 assume !(diff_~found~0 == 0); 60#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := diff_#t~post7 + 1;havoc diff_#t~post7; 57#L554-3 [2018-11-10 04:27:33,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:33,245 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-10 04:27:33,245 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:33,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:33,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:27:33,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:33,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:33,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1455442957, now seen corresponding path program 1 times [2018-11-10 04:27:33,271 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:33,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:33,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:27:33,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:33,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:27:33,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:27:33,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:27:33,295 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:27:33,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:27:33,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:27:33,296 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-10 04:27:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:27:33,326 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2018-11-10 04:27:33,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:27:33,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2018-11-10 04:27:33,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 04:27:33,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 29 transitions. [2018-11-10 04:27:33,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 04:27:33,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 04:27:33,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2018-11-10 04:27:33,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:27:33,329 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-10 04:27:33,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2018-11-10 04:27:33,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-11-10 04:27:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-10 04:27:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-11-10 04:27:33,330 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-10 04:27:33,330 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-10 04:27:33,330 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:27:33,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-11-10 04:27:33,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:27:33,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:27:33,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:27:33,331 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 04:27:33,331 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:27:33,331 INFO L793 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 108#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 109#L574 assume !(main_~Alen~0 < 1); 112#L574-2 assume !(main_~Blen~0 < 1); 103#L577-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;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; 104#L554-3 [2018-11-10 04:27:33,331 INFO L795 eck$LassoCheckResult]: Loop: 104#L554-3 assume true; 111#L554-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 102#L558-4 assume true; 115#L557-1 assume !(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 107#L557-3 assume diff_~found~0 == 0; 105#L565 SUMMARY for call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L565 106#L565-1 SUMMARY for call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + diff_~k~0 * 4, 4); srcloc: L565-1 110#L565-2 havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := diff_#t~post6 + 1;havoc diff_#t~post6; 114#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := diff_#t~post7 + 1;havoc diff_#t~post7; 104#L554-3 [2018-11-10 04:27:33,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:33,332 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2018-11-10 04:27:33,332 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:33,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:33,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:27:33,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:33,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:33,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1401533195, now seen corresponding path program 1 times [2018-11-10 04:27:33,353 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:33,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:33,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:27:33,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:33,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:33,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1410862234, now seen corresponding path program 1 times [2018-11-10 04:27:33,370 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:33,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:33,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:27:33,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:27:33,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:27:33,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:27:33,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:27:33,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:27:33,567 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-10 04:27:33,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:27:33,602 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2018-11-10 04:27:33,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:27:33,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2018-11-10 04:27:33,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 04:27:33,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 32 transitions. [2018-11-10 04:27:33,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-10 04:27:33,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-10 04:27:33,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2018-11-10 04:27:33,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:27:33,604 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-10 04:27:33,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2018-11-10 04:27:33,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-11-10 04:27:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 04:27:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-11-10 04:27:33,606 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-10 04:27:33,606 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-10 04:27:33,606 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 04:27:33,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2018-11-10 04:27:33,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 04:27:33,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:27:33,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:27:33,607 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 04:27:33,607 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:27:33,607 INFO L793 eck$LassoCheckResult]: Stem: 174#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 168#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 169#L574 assume !(main_~Alen~0 < 1); 172#L574-2 assume !(main_~Blen~0 < 1); 161#L577-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;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; 162#L554-3 [2018-11-10 04:27:33,607 INFO L795 eck$LassoCheckResult]: Loop: 162#L554-3 assume true; 170#L554-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 171#L558-4 assume true; 158#L557-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 155#L558 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L558 156#L558-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L558-1 157#L558-2 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 159#L558-4 assume true; 176#L557-1 assume !(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 175#L557-3 assume !(diff_~found~0 == 0); 173#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := diff_#t~post7 + 1;havoc diff_#t~post7; 162#L554-3 [2018-11-10 04:27:33,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:33,608 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2018-11-10 04:27:33,608 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:33,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:33,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:27:33,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:33,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:33,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1591366400, now seen corresponding path program 1 times [2018-11-10 04:27:33,625 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:33,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:33,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:27:33,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:33,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:33,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1526022811, now seen corresponding path program 1 times [2018-11-10 04:27:33,637 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:33,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:33,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:27:33,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:33,903 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-11-10 04:27:34,022 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-11-10 04:27:34,031 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:27:34,031 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:27:34,032 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:27:34,032 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:27:34,032 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:27:34,032 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:27:34,032 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:27:34,032 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:27:34,032 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-10 04:27:34,032 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:27:34,033 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:27:34,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:34,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:34,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:34,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:34,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:34,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:34,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:34,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:34,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:34,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:34,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:34,389 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 113 [2018-11-10 04:27:34,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:34,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:34,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:34,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:34,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:34,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:34,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:34,907 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:27:34,911 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:27:34,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:34,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:34,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:27:34,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:34,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:34,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:34,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:27:34,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:27:34,917 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:34,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:34,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:34,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:27:34,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:34,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:34,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:34,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:27:34,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:27:34,919 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:34,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:34,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:34,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:34,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:34,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:34,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:34,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:34,924 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:34,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:34,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:34,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:34,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:34,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:34,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:34,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:34,928 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:34,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:34,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:34,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:34,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:34,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:34,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:34,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:34,936 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:34,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:34,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:34,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:34,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:34,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:34,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:34,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:34,942 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:34,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:34,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:34,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:27:34,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:34,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:34,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:34,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:27:34,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:27:34,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:34,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:34,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:34,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:34,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:34,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:34,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:34,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:34,952 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:34,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:34,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:34,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:27:34,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:34,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:34,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:34,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:27:34,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:27:34,955 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:34,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:34,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:34,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:27:34,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:34,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:34,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:34,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:27:34,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:27:34,957 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:34,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:34,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:34,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:34,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:34,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:34,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:34,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:34,967 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:34,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:34,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:34,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:34,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:34,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:34,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:34,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:34,972 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:34,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:34,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:34,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:34,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:34,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:34,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:34,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:35,005 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:27:35,043 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 04:27:35,044 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 04:27:35,045 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:27:35,048 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:27:35,048 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:27:35,048 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_diff_~A.base)_1, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~A.offset) = 1*v_rep(select #length ULTIMATE.start_diff_~A.base)_1 - 4*ULTIMATE.start_diff_~i~0 - 1*ULTIMATE.start_diff_~A.offset Supporting invariants [] [2018-11-10 04:27:35,116 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-10 04:27:35,121 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:27:35,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:35,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:27:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:35,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:27:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:27:35,167 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 04:27:35,167 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-10 04:27:35,198 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 41 states and 52 transitions. Complement of second has 6 states. [2018-11-10 04:27:35,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:27:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:27:35,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-10 04:27:35,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 11 letters. [2018-11-10 04:27:35,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:27:35,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 16 letters. Loop has 11 letters. [2018-11-10 04:27:35,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:27:35,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 22 letters. [2018-11-10 04:27:35,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:27:35,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 52 transitions. [2018-11-10 04:27:35,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 04:27:35,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 35 states and 44 transitions. [2018-11-10 04:27:35,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 04:27:35,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-10 04:27:35,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2018-11-10 04:27:35,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:27:35,203 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2018-11-10 04:27:35,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2018-11-10 04:27:35,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-11-10 04:27:35,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 04:27:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-11-10 04:27:35,205 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-10 04:27:35,205 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-10 04:27:35,205 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 04:27:35,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2018-11-10 04:27:35,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:27:35,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:27:35,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:27:35,205 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:27:35,206 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:27:35,206 INFO L793 eck$LassoCheckResult]: Stem: 374#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 367#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 368#L574 assume !(main_~Alen~0 < 1); 371#L574-2 assume !(main_~Blen~0 < 1); 360#L577-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;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; 361#L554-3 assume true; 369#L554-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 355#L558-4 [2018-11-10 04:27:35,206 INFO L795 eck$LassoCheckResult]: Loop: 355#L558-4 assume true; 358#L557-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 349#L558 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L558 350#L558-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L558-1 353#L558-2 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 355#L558-4 [2018-11-10 04:27:35,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:35,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935596, now seen corresponding path program 1 times [2018-11-10 04:27:35,206 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:35,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:35,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:35,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:27:35,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:35,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:35,216 INFO L82 PathProgramCache]: Analyzing trace with hash 56489728, now seen corresponding path program 1 times [2018-11-10 04:27:35,216 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:35,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:35,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:35,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:27:35,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:35,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:35,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2103604149, now seen corresponding path program 1 times [2018-11-10 04:27:35,225 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:35,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:35,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:35,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:27:35,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:35,521 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 118 [2018-11-10 04:27:35,618 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:27:35,619 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:27:35,619 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:27:35,619 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:27:35,619 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:27:35,619 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:27:35,619 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:27:35,619 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:27:35,619 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-10 04:27:35,619 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:27:35,619 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:27:35,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:35,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:35,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:35,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:35,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:35,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:35,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:35,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:35,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:35,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:35,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:35,910 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 119 [2018-11-10 04:27:35,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:35,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:35,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:35,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:35,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:35,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:35,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:36,167 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-10 04:27:36,435 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:27:36,435 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:27:36,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:36,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:36,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:36,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:36,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:36,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:36,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:36,443 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:27:36,445 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 04:27:36,445 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 04:27:36,445 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:27:36,446 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:27:36,446 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:27:36,446 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~found~0) = -2*ULTIMATE.start_diff_~found~0 + 1 Supporting invariants [] [2018-11-10 04:27:36,481 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-10 04:27:36,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:36,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:27:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:36,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:27:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:27:36,532 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 04:27:36,533 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-10 04:27:36,569 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 91 states and 114 transitions. Complement of second has 7 states. [2018-11-10 04:27:36,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:27:36,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:27:36,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-10 04:27:36,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-10 04:27:36,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:27:36,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-10 04:27:36,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:27:36,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 7 letters. Loop has 10 letters. [2018-11-10 04:27:36,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:27:36,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 114 transitions. [2018-11-10 04:27:36,572 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 04:27:36,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 87 states and 110 transitions. [2018-11-10 04:27:36,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 04:27:36,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 04:27:36,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2018-11-10 04:27:36,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:27:36,574 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2018-11-10 04:27:36,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2018-11-10 04:27:36,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2018-11-10 04:27:36,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 04:27:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2018-11-10 04:27:36,580 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 98 transitions. [2018-11-10 04:27:36,580 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 98 transitions. [2018-11-10 04:27:36,580 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 04:27:36,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 98 transitions. [2018-11-10 04:27:36,581 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 04:27:36,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:27:36,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:27:36,582 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:27:36,582 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:27:36,582 INFO L793 eck$LassoCheckResult]: Stem: 625#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 616#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 617#L574 assume !(main_~Alen~0 < 1); 621#L574-2 assume !(main_~Blen~0 < 1); 607#L577-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;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; 608#L554-3 assume true; 626#L554-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 630#L558-4 assume true; 611#L557-1 [2018-11-10 04:27:36,583 INFO L795 eck$LassoCheckResult]: Loop: 611#L557-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 632#L558 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L558 631#L558-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L558-1 600#L558-2 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := diff_#t~post4 + 1;havoc diff_#t~post4; 601#L558-4 assume true; 611#L557-1 [2018-11-10 04:27:36,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:36,584 INFO L82 PathProgramCache]: Analyzing trace with hash 180428657, now seen corresponding path program 1 times [2018-11-10 04:27:36,584 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:36,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:36,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:36,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:27:36,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:36,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:36,593 INFO L82 PathProgramCache]: Analyzing trace with hash 62061750, now seen corresponding path program 1 times [2018-11-10 04:27:36,593 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:36,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:36,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:36,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:27:36,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:36,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:36,598 INFO L82 PathProgramCache]: Analyzing trace with hash 787219270, now seen corresponding path program 1 times [2018-11-10 04:27:36,598 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:36,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:36,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:36,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:27:36,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:36,859 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 117 [2018-11-10 04:27:36,954 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:27:36,954 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:27:36,954 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:27:36,954 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:27:36,954 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:27:36,954 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:27:36,954 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:27:36,954 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:27:36,954 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-10 04:27:36,954 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:27:36,954 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:27:36,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:36,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:36,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:36,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:36,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:36,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:36,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:36,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:36,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:37,222 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 115 [2018-11-10 04:27:37,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:37,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:37,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:37,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:37,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:37,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:37,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:37,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:37,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:37,638 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:27:37,639 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:27:37,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:37,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:37,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:27:37,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:37,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:37,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:37,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:27:37,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:27:37,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:37,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:37,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:37,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:37,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:37,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:37,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:37,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:37,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:37,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:37,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:37,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:37,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:37,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:37,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:37,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:37,652 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:37,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:37,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:37,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:27:37,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:37,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:37,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:37,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:27:37,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:27:37,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:37,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:37,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:37,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:37,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:37,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:37,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:37,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:37,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:37,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:37,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:37,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:37,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:37,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:37,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:37,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:37,658 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:37,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:37,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:37,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:27:37,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:37,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:37,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:37,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:27:37,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:27:37,660 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:37,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:37,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:37,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:27:37,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:37,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:37,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:37,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:27:37,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:27:37,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:37,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:37,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:37,662 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:27:37,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:37,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:37,663 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:27:37,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:37,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:37,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:37,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:37,668 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:27:37,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:37,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:37,669 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:27:37,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:37,673 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:37,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:37,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:37,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:37,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:37,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:37,674 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:37,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:37,675 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:37,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:37,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:37,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:37,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:37,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:37,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:37,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:37,685 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:37,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:37,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:37,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:37,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:37,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:37,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:37,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:37,693 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:37,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:37,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:37,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:37,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:37,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:37,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:37,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:37,705 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:27:37,724 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 04:27:37,724 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 04:27:37,725 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:27:37,725 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-10 04:27:37,726 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:27:37,726 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~j~0, v_rep(select #length ULTIMATE.start_diff_~B.base)_3) = -4*ULTIMATE.start_diff_~j~0 + 1*v_rep(select #length ULTIMATE.start_diff_~B.base)_3 Supporting invariants [1*ULTIMATE.start_diff_~B.offset >= 0] [2018-11-10 04:27:37,776 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-11-10 04:27:37,778 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:27:37,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:37,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:27:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:37,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:27:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:27:37,835 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 04:27:37,835 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 98 transitions. cyclomatic complexity: 27 Second operand 6 states. [2018-11-10 04:27:37,884 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 98 transitions. cyclomatic complexity: 27. Second operand 6 states. Result 218 states and 261 transitions. Complement of second has 8 states. [2018-11-10 04:27:37,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:27:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 04:27:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-10 04:27:37,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-10 04:27:37,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:27:37,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 13 letters. Loop has 5 letters. [2018-11-10 04:27:37,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:27:37,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 8 letters. Loop has 10 letters. [2018-11-10 04:27:37,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:27:37,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 218 states and 261 transitions. [2018-11-10 04:27:37,889 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 04:27:37,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 218 states to 140 states and 173 transitions. [2018-11-10 04:27:37,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-10 04:27:37,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-10 04:27:37,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 173 transitions. [2018-11-10 04:27:37,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:27:37,894 INFO L705 BuchiCegarLoop]: Abstraction has 140 states and 173 transitions. [2018-11-10 04:27:37,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 173 transitions. [2018-11-10 04:27:37,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 94. [2018-11-10 04:27:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 04:27:37,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2018-11-10 04:27:37,898 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 120 transitions. [2018-11-10 04:27:37,900 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 120 transitions. [2018-11-10 04:27:37,900 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 04:27:37,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 120 transitions. [2018-11-10 04:27:37,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 04:27:37,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:27:37,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:27:37,902 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:27:37,902 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:27:37,902 INFO L793 eck$LassoCheckResult]: Stem: 1056#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1049#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1050#L574 assume !(main_~Alen~0 < 1); 1055#L574-2 assume !(main_~Blen~0 < 1); 1039#L577-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;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; 1040#L554-3 assume true; 1059#L554-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1108#L558-4 assume true; 1106#L557-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 1094#L558 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L558 1095#L558-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L558-1 1091#L558-2 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 1089#L558-4 assume true; 1088#L557-1 assume !(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 1074#L557-3 assume !(diff_~found~0 == 0); 1072#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := diff_#t~post7 + 1;havoc diff_#t~post7; 1070#L554-3 assume true; 1069#L554-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1043#L558-4 [2018-11-10 04:27:37,902 INFO L795 eck$LassoCheckResult]: Loop: 1043#L558-4 assume true; 1044#L557-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 1024#L558 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L558 1025#L558-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L558-1 1068#L558-2 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 1043#L558-4 [2018-11-10 04:27:37,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:37,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1924074049, now seen corresponding path program 2 times [2018-11-10 04:27:37,902 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:37,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:37,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:37,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:27:37,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:37,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:37,921 INFO L82 PathProgramCache]: Analyzing trace with hash 56489728, now seen corresponding path program 2 times [2018-11-10 04:27:37,921 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:37,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:37,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:37,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:27:37,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:37,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:37,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1673221312, now seen corresponding path program 3 times [2018-11-10 04:27:37,929 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:37,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:37,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:37,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:27:37,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:38,304 WARN L179 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 141 [2018-11-10 04:27:38,437 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-11-10 04:27:38,439 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:27:38,439 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:27:38,439 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:27:38,439 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:27:38,439 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:27:38,439 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:27:38,439 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:27:38,440 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:27:38,440 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-10 04:27:38,440 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:27:38,440 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:27:38,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:38,730 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 123 [2018-11-10 04:27:38,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:38,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:38,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:38,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:38,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:38,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:38,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:38,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:38,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:38,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:38,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:38,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:38,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:38,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:38,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:38,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:38,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:38,962 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-11-10 04:27:39,291 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:27:39,291 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:27:39,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:39,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:39,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:39,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:39,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:39,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:39,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:39,296 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:39,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:39,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:39,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:39,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:39,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:39,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:39,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:39,304 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:39,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:39,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:39,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:39,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:39,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:39,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:39,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:39,325 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:39,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:39,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:39,326 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:27:39,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:39,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:39,327 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:27:39,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:39,330 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:39,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:39,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:39,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:39,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:39,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:39,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:39,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:39,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:39,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:39,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:39,333 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:27:39,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:39,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:39,334 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:27:39,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:39,337 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:39,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:39,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:39,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:39,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:39,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:39,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:39,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:39,339 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:39,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:39,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:39,340 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:27:39,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:39,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:39,341 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:27:39,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:39,345 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:39,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:39,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:39,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:27:39,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:39,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:39,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:39,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:27:39,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:27:39,346 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:39,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:39,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:39,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:39,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:39,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:39,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:39,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:39,349 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:39,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:39,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:39,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:39,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:39,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:39,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:39,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:39,354 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:39,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:39,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:39,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:39,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:39,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:39,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:39,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:39,357 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:39,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:39,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:39,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:39,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:39,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:39,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:39,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:39,359 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:39,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:39,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:39,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:27:39,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:39,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:39,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:39,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:27:39,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:27:39,361 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:39,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:39,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:39,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:27:39,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:39,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:39,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:39,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:27:39,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:27:39,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:39,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:39,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:39,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:39,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:39,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:39,363 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:39,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:39,366 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:27:39,368 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 04:27:39,368 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 04:27:39,368 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:27:39,368 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:27:39,369 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:27:39,369 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~found~0) = -2*ULTIMATE.start_diff_~found~0 + 1 Supporting invariants [] [2018-11-10 04:27:39,463 INFO L297 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2018-11-10 04:27:39,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:39,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:27:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:39,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:27:39,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:27:39,514 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 04:27:39,514 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 120 transitions. cyclomatic complexity: 35 Second operand 4 states. [2018-11-10 04:27:39,561 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 120 transitions. cyclomatic complexity: 35. Second operand 4 states. Result 175 states and 224 transitions. Complement of second has 7 states. [2018-11-10 04:27:39,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:27:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:27:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-10 04:27:39,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 18 letters. Loop has 5 letters. [2018-11-10 04:27:39,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:27:39,563 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:27:39,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:39,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:27:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:39,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:27:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:27:39,596 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 [2018-11-10 04:27:39,596 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 120 transitions. cyclomatic complexity: 35 Second operand 4 states. [2018-11-10 04:27:39,615 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 120 transitions. cyclomatic complexity: 35. Second operand 4 states. Result 175 states and 224 transitions. Complement of second has 7 states. [2018-11-10 04:27:39,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:27:39,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:27:39,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-10 04:27:39,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 18 letters. Loop has 5 letters. [2018-11-10 04:27:39,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:27:39,616 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:27:39,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:39,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:27:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:39,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:27:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:27:39,644 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 [2018-11-10 04:27:39,644 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 120 transitions. cyclomatic complexity: 35 Second operand 4 states. [2018-11-10 04:27:39,664 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 120 transitions. cyclomatic complexity: 35. Second operand 4 states. Result 222 states and 279 transitions. Complement of second has 11 states. [2018-11-10 04:27:39,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:27:39,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:27:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2018-11-10 04:27:39,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 18 letters. Loop has 5 letters. [2018-11-10 04:27:39,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:27:39,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 23 letters. Loop has 5 letters. [2018-11-10 04:27:39,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:27:39,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 18 letters. Loop has 10 letters. [2018-11-10 04:27:39,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:27:39,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 279 transitions. [2018-11-10 04:27:39,669 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 04:27:39,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 142 states and 178 transitions. [2018-11-10 04:27:39,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-10 04:27:39,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-10 04:27:39,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 178 transitions. [2018-11-10 04:27:39,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:27:39,670 INFO L705 BuchiCegarLoop]: Abstraction has 142 states and 178 transitions. [2018-11-10 04:27:39,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 178 transitions. [2018-11-10 04:27:39,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 77. [2018-11-10 04:27:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 04:27:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2018-11-10 04:27:39,674 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 100 transitions. [2018-11-10 04:27:39,674 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 100 transitions. [2018-11-10 04:27:39,674 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 04:27:39,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 100 transitions. [2018-11-10 04:27:39,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:27:39,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:27:39,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:27:39,675 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:27:39,675 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:27:39,675 INFO L793 eck$LassoCheckResult]: Stem: 2057#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2049#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 2050#L574 assume !(main_~Alen~0 < 1); 2056#L574-2 assume !(main_~Blen~0 < 1); 2042#L577-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;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; 2043#L554-3 assume true; 2061#L554-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 2086#L558-4 assume true; 2083#L557-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 2085#L558 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L558 2094#L558-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L558-1 2092#L558-2 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 2089#L558-4 assume true; 2069#L557-1 assume !(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 2067#L557-3 assume !(diff_~found~0 == 0); 2068#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := diff_#t~post7 + 1;havoc diff_#t~post7; 2104#L554-3 assume true; 2105#L554-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 2106#L558-4 assume true; 2037#L557-1 [2018-11-10 04:27:39,675 INFO L795 eck$LassoCheckResult]: Loop: 2037#L557-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 2030#L558 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L558 2031#L558-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L558-1 2034#L558-2 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := diff_#t~post4 + 1;havoc diff_#t~post4; 2039#L558-4 assume true; 2037#L557-1 [2018-11-10 04:27:39,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:39,676 INFO L82 PathProgramCache]: Analyzing trace with hash -483246596, now seen corresponding path program 4 times [2018-11-10 04:27:39,676 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:39,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:39,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:39,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:27:39,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:39,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:39,692 INFO L82 PathProgramCache]: Analyzing trace with hash 62061750, now seen corresponding path program 2 times [2018-11-10 04:27:39,692 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:39,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:39,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:39,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:27:39,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:39,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:39,697 INFO L82 PathProgramCache]: Analyzing trace with hash 330253211, now seen corresponding path program 1 times [2018-11-10 04:27:39,697 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:27:39,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:27:39,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:39,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:27:39,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:27:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:27:40,074 WARN L179 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 141 [2018-11-10 04:27:40,181 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-11-10 04:27:40,182 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:27:40,182 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:27:40,182 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:27:40,183 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:27:40,183 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:27:40,183 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:27:40,183 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:27:40,183 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:27:40,183 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration8_Lasso [2018-11-10 04:27:40,183 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:27:40,183 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:27:40,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:40,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:40,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:40,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:40,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:40,467 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 121 [2018-11-10 04:27:40,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:40,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:40,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:40,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:40,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:40,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:40,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:40,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:40,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:40,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:40,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:40,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:40,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:27:40,903 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-10 04:27:40,985 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:27:40,985 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:27:40,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:40,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:40,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:27:40,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:40,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:40,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:40,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:27:40,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:27:40,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:40,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:40,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:40,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:27:40,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:40,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:40,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:40,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:27:40,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:27:40,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:40,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:40,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:40,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:40,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:40,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:40,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:40,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:40,990 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:40,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:40,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:40,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:40,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:40,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:40,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:40,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:40,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:40,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:40,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:40,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:40,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:40,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:40,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:40,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:40,998 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:40,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:40,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:40,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:40,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:40,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:40,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:40,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:41,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:41,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:41,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:41,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:41,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:41,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:41,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:41,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:41,004 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:41,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:41,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:41,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:41,005 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 04:27:41,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:41,007 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-10 04:27:41,007 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 04:27:41,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:41,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:41,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:41,014 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:27:41,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:41,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:41,015 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:27:41,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:41,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:41,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:41,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:41,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:27:41,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:41,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:41,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:41,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:27:41,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:27:41,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:27:41,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:27:41,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:27:41,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:27:41,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:27:41,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:27:41,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:27:41,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:27:41,046 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:27:41,065 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 04:27:41,065 INFO L444 ModelExtractionUtils]: 82 out of 88 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 04:27:41,065 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:27:41,067 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:27:41,067 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:27:41,068 INFO L519 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 [] [2018-11-10 04:27:41,114 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2018-11-10 04:27:41,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:41,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:27:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:41,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:27:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:27:41,156 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 04:27:41,156 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 100 transitions. cyclomatic complexity: 30 Second operand 4 states. [2018-11-10 04:27:41,166 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 100 transitions. cyclomatic complexity: 30. Second operand 4 states. Result 172 states and 208 transitions. Complement of second has 7 states. [2018-11-10 04:27:41,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:27:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:27:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-11-10 04:27:41,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 19 letters. Loop has 5 letters. [2018-11-10 04:27:41,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:27:41,168 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:27:41,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:41,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:27:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:41,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:27:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:27:41,203 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 04:27:41,203 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 100 transitions. cyclomatic complexity: 30 Second operand 4 states. [2018-11-10 04:27:41,223 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 100 transitions. cyclomatic complexity: 30. Second operand 4 states. Result 169 states and 204 transitions. Complement of second has 9 states. [2018-11-10 04:27:41,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 04:27:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:27:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-10 04:27:41,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 19 letters. Loop has 5 letters. [2018-11-10 04:27:41,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:27:41,225 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:27:41,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:27:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:41,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:27:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:27:41,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:27:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:27:41,258 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 3 loop predicates [2018-11-10 04:27:41,258 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 100 transitions. cyclomatic complexity: 30 Second operand 4 states. [2018-11-10 04:27:41,274 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 100 transitions. cyclomatic complexity: 30. Second operand 4 states. Result 201 states and 248 transitions. Complement of second has 13 states. [2018-11-10 04:27:41,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:27:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:27:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2018-11-10 04:27:41,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 19 letters. Loop has 5 letters. [2018-11-10 04:27:41,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:27:41,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 24 letters. Loop has 5 letters. [2018-11-10 04:27:41,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:27:41,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 19 letters. Loop has 10 letters. [2018-11-10 04:27:41,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:27:41,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 201 states and 248 transitions. [2018-11-10 04:27:41,278 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:27:41,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 201 states to 0 states and 0 transitions. [2018-11-10 04:27:41,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 04:27:41,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 04:27:41,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 04:27:41,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:27:41,282 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:27:41,282 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:27:41,282 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:27:41,283 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 04:27:41,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:27:41,283 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:27:41,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 04:27:41,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 04:27:41 BoogieIcfgContainer [2018-11-10 04:27:41,288 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 04:27:41,289 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:27:41,289 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:27:41,289 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:27:41,289 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:27:32" (3/4) ... [2018-11-10 04:27:41,292 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 04:27:41,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:27:41,293 INFO L168 Benchmark]: Toolchain (without parser) took 8910.13 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.8 MB). Free memory was 957.6 MB in the beginning and 1.2 GB in the end (delta: -223.9 MB). Peak memory consumption was 94.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:27:41,294 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:27:41,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.01 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:27:41,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:27:41,295 INFO L168 Benchmark]: Boogie Preprocessor took 15.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:27:41,296 INFO L168 Benchmark]: RCFGBuilder took 212.20 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:27:41,296 INFO L168 Benchmark]: BuchiAutomizer took 8289.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.6 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:27:41,296 INFO L168 Benchmark]: Witness Printer took 3.84 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:27:41,300 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 314.01 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 212.20 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8289.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.6 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.84 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[A] + -4 * i + -1 * A and consists of 4 locations. One deterministic module has affine ranking function -2 * found + 1 and consists of 4 locations. One deterministic module has affine ranking function -4 * j + unknown-#length-unknown[B] and consists of 5 locations. One nondeterministic module has affine ranking function -2 * found + 1 and consists of 4 locations. One nondeterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 7.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 133 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 94 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 300 SDtfs, 384 SDslu, 175 SDs, 0 SdLazy, 168 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital271 mio100 ax106 hnf99 lsp83 ukn107 mio100 lsp46 div100 bol100 ite100 ukn100 eq193 hnf88 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...