./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-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_48974fb2-865e-4f56-8cc2-b10828f48da9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_48974fb2-865e-4f56-8cc2-b10828f48da9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_48974fb2-865e-4f56-8cc2-b10828f48da9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_48974fb2-865e-4f56-8cc2-b10828f48da9/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_48974fb2-865e-4f56-8cc2-b10828f48da9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_48974fb2-865e-4f56-8cc2-b10828f48da9/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 9b56ae1f9bab9d3b2bc1bd2f033ce64d7d92cfe1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 05:19:35,561 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:19:35,562 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:19:35,571 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:19:35,572 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:19:35,572 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:19:35,573 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:19:35,575 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:19:35,576 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:19:35,576 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:19:35,577 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:19:35,577 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:19:35,578 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:19:35,578 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:19:35,579 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:19:35,580 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:19:35,581 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:19:35,582 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:19:35,583 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:19:35,584 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:19:35,585 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:19:35,586 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:19:35,588 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:19:35,588 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:19:35,588 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:19:35,589 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:19:35,590 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:19:35,590 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:19:35,591 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:19:35,592 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:19:35,592 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:19:35,592 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:19:35,593 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:19:35,593 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:19:35,593 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:19:35,594 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:19:35,594 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_48974fb2-865e-4f56-8cc2-b10828f48da9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 05:19:35,606 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:19:35,606 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:19:35,607 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:19:35,607 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:19:35,608 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:19:35,608 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:19:35,608 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:19:35,608 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:19:35,608 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:19:35,608 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:19:35,609 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:19:35,609 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:19:35,609 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:19:35,609 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:19:35,609 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:19:35,609 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:19:35,610 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:19:35,610 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:19:35,610 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:19:35,610 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:19:35,610 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:19:35,610 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:19:35,611 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:19:35,611 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:19:35,611 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:19:35,611 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:19:35,611 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:19:35,612 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:19:35,612 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_48974fb2-865e-4f56-8cc2-b10828f48da9/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 -> 9b56ae1f9bab9d3b2bc1bd2f033ce64d7d92cfe1 [2018-11-10 05:19:35,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:19:35,649 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:19:35,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:19:35,653 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:19:35,654 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:19:35,654 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_48974fb2-865e-4f56-8cc2-b10828f48da9/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i [2018-11-10 05:19:35,707 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48974fb2-865e-4f56-8cc2-b10828f48da9/bin-2019/uautomizer/data/f2eda9df2/f291162b745444e08d6b846f99d7c58d/FLAG9a83b9af6 [2018-11-10 05:19:36,093 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:19:36,094 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_48974fb2-865e-4f56-8cc2-b10828f48da9/sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i [2018-11-10 05:19:36,101 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48974fb2-865e-4f56-8cc2-b10828f48da9/bin-2019/uautomizer/data/f2eda9df2/f291162b745444e08d6b846f99d7c58d/FLAG9a83b9af6 [2018-11-10 05:19:36,111 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_48974fb2-865e-4f56-8cc2-b10828f48da9/bin-2019/uautomizer/data/f2eda9df2/f291162b745444e08d6b846f99d7c58d [2018-11-10 05:19:36,113 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:19:36,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:19:36,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:19:36,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:19:36,119 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:19:36,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:19:36" (1/1) ... [2018-11-10 05:19:36,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@662aff13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:36, skipping insertion in model container [2018-11-10 05:19:36,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:19:36" (1/1) ... [2018-11-10 05:19:36,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:19:36,165 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:19:36,364 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:19:36,373 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:19:36,407 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:19:36,437 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:19:36,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:36 WrapperNode [2018-11-10 05:19:36,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:19:36,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:19:36,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:19:36,438 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:19:36,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:36" (1/1) ... [2018-11-10 05:19:36,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:36" (1/1) ... [2018-11-10 05:19:36,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:19:36,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:19:36,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:19:36,520 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:19:36,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:36" (1/1) ... [2018-11-10 05:19:36,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:36" (1/1) ... [2018-11-10 05:19:36,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:36" (1/1) ... [2018-11-10 05:19:36,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:36" (1/1) ... [2018-11-10 05:19:36,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:36" (1/1) ... [2018-11-10 05:19:36,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:36" (1/1) ... [2018-11-10 05:19:36,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:36" (1/1) ... [2018-11-10 05:19:36,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:19:36,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:19:36,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:19:36,539 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:19:36,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48974fb2-865e-4f56-8cc2-b10828f48da9/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 05:19:36,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 05:19:36,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 05:19:36,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:19:36,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:19:36,835 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:19:36,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:19:36 BoogieIcfgContainer [2018-11-10 05:19:36,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:19:36,836 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:19:36,836 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:19:36,839 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:19:36,840 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:19:36,841 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:19:36" (1/3) ... [2018-11-10 05:19:36,842 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d032025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:19:36, skipping insertion in model container [2018-11-10 05:19:36,842 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:19:36,842 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:36" (2/3) ... [2018-11-10 05:19:36,842 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d032025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:19:36, skipping insertion in model container [2018-11-10 05:19:36,842 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:19:36,842 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:19:36" (3/3) ... [2018-11-10 05:19:36,844 INFO L375 chiAutomizerObserver]: Analyzing ICFG Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i [2018-11-10 05:19:36,884 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:19:36,885 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:19:36,885 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:19:36,885 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:19:36,885 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:19:36,885 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:19:36,885 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:19:36,885 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:19:36,885 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:19:36,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-10 05:19:36,913 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-10 05:19:36,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:19:36,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:19:36,918 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:19:36,919 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:19:36,919 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:19:36,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-10 05:19:36,921 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-10 05:19:36,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:19:36,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:19:36,921 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:19:36,921 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:19:36,930 INFO L793 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet22;havoc main_#t~nondet22;main_~y~0 := main_#t~nondet23;havoc main_#t~nondet23;assume { :begin_inline_subxy } true;subxy_#in~x, subxy_#in~y := main_~x~0, main_~y~0;havoc subxy_#res;havoc subxy_#t~malloc2.base, subxy_#t~malloc2.offset, subxy_#t~malloc3.base, subxy_#t~malloc3.offset, subxy_#t~malloc4.base, subxy_#t~malloc4.offset, subxy_#t~malloc5.base, subxy_#t~malloc5.offset, subxy_#t~mem6, subxy_#t~mem7, subxy_#t~mem8, subxy_#t~short9, subxy_#t~mem11, subxy_#t~post12, subxy_#t~mem13, subxy_#t~post14, subxy_#t~mem10, subxy_#t~mem17, subxy_#t~post18, subxy_#t~mem19, subxy_#t~post20, subxy_#t~mem15, subxy_#t~mem16, subxy_#t~mem21, subxy_~x, subxy_~y, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, subxy_~z~0.base, subxy_~z~0.offset, subxy_~i~0.base, subxy_~i~0.offset;subxy_~x := subxy_#in~x;subxy_~y := subxy_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];subxy_#t~malloc2.base, subxy_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;subxy_~x_ref~0.base, subxy_~x_ref~0.offset := subxy_#t~malloc2.base, subxy_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];subxy_#t~malloc3.base, subxy_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;subxy_~y_ref~0.base, subxy_~y_ref~0.offset := subxy_#t~malloc3.base, subxy_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];subxy_#t~malloc4.base, subxy_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;subxy_~z~0.base, subxy_~z~0.offset := subxy_#t~malloc4.base, subxy_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];subxy_#t~malloc5.base, subxy_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;subxy_~i~0.base, subxy_~i~0.offset := subxy_#t~malloc5.base, subxy_#t~malloc5.offset; 14#L552true SUMMARY for call write~int(subxy_~x, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4); srcloc: L552 18#L552-1true SUMMARY for call write~int(subxy_~y, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); srcloc: L552-1 38#L553true SUMMARY for call write~int(0, subxy_~z~0.base, subxy_~z~0.offset, 4); srcloc: L553 35#L554true SUMMARY for call subxy_#t~mem6 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4); srcloc: L554 7#L555true SUMMARY for call write~int(subxy_#t~mem6, subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L555 9#L555-1true havoc subxy_#t~mem6; 31#L556true SUMMARY for call subxy_#t~mem7 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); srcloc: L556 33#L556-1true subxy_#t~short9 := subxy_#t~mem7 <= 0; 36#L556-2true assume subxy_#t~short9; 23#L556-6true assume !subxy_#t~short9;havoc subxy_#t~short9;havoc subxy_#t~mem8;havoc subxy_#t~mem7; 8#L559-4true [2018-11-10 05:19:36,930 INFO L795 eck$LassoCheckResult]: Loop: 8#L559-4true assume true; 3#L559-1true SUMMARY for call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L559-1 6#L559-2true assume !!(subxy_#t~mem10 > 0);havoc subxy_#t~mem10; 44#L560true SUMMARY for call subxy_#t~mem11 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L560 45#L560-1true subxy_#t~post12 := subxy_#t~mem11; 28#L560-2true SUMMARY for call write~int(subxy_#t~post12 - 1, subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L560-2 29#L560-3true havoc subxy_#t~mem11;havoc subxy_#t~post12; 22#L561true SUMMARY for call subxy_#t~mem13 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4); srcloc: L561 25#L561-1true subxy_#t~post14 := subxy_#t~mem13; 27#L561-2true SUMMARY for call write~int(subxy_#t~post14 + 1, subxy_~z~0.base, subxy_~z~0.offset, 4); srcloc: L561-2 5#L561-3true havoc subxy_#t~mem13;havoc subxy_#t~post14; 8#L559-4true [2018-11-10 05:19:36,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:19:36,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1754487247, now seen corresponding path program 1 times [2018-11-10 05:19:36,938 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:19:36,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:19:36,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:36,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:19:36,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:19:37,078 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 05:19:37,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:19:37,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:19:37,083 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:19:37,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:19:37,083 INFO L82 PathProgramCache]: Analyzing trace with hash -22042653, now seen corresponding path program 1 times [2018-11-10 05:19:37,084 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:19:37,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:19:37,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:37,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:19:37,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:19:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:19:37,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:19:37,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:19:37,259 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-11-10 05:19:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:19:37,306 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-10 05:19:37,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:19:37,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 47 transitions. [2018-11-10 05:19:37,311 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-10 05:19:37,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 37 states and 38 transitions. [2018-11-10 05:19:37,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-10 05:19:37,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-11-10 05:19:37,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 38 transitions. [2018-11-10 05:19:37,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:19:37,319 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-10 05:19:37,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 38 transitions. [2018-11-10 05:19:37,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-10 05:19:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 05:19:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-10 05:19:37,347 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-10 05:19:37,348 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-10 05:19:37,348 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:19:37,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 38 transitions. [2018-11-10 05:19:37,349 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-10 05:19:37,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:19:37,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:19:37,350 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:19:37,350 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:19:37,350 INFO L793 eck$LassoCheckResult]: Stem: 130#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 107#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet22;havoc main_#t~nondet22;main_~y~0 := main_#t~nondet23;havoc main_#t~nondet23;assume { :begin_inline_subxy } true;subxy_#in~x, subxy_#in~y := main_~x~0, main_~y~0;havoc subxy_#res;havoc subxy_#t~malloc2.base, subxy_#t~malloc2.offset, subxy_#t~malloc3.base, subxy_#t~malloc3.offset, subxy_#t~malloc4.base, subxy_#t~malloc4.offset, subxy_#t~malloc5.base, subxy_#t~malloc5.offset, subxy_#t~mem6, subxy_#t~mem7, subxy_#t~mem8, subxy_#t~short9, subxy_#t~mem11, subxy_#t~post12, subxy_#t~mem13, subxy_#t~post14, subxy_#t~mem10, subxy_#t~mem17, subxy_#t~post18, subxy_#t~mem19, subxy_#t~post20, subxy_#t~mem15, subxy_#t~mem16, subxy_#t~mem21, subxy_~x, subxy_~y, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, subxy_~z~0.base, subxy_~z~0.offset, subxy_~i~0.base, subxy_~i~0.offset;subxy_~x := subxy_#in~x;subxy_~y := subxy_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];subxy_#t~malloc2.base, subxy_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;subxy_~x_ref~0.base, subxy_~x_ref~0.offset := subxy_#t~malloc2.base, subxy_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];subxy_#t~malloc3.base, subxy_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;subxy_~y_ref~0.base, subxy_~y_ref~0.offset := subxy_#t~malloc3.base, subxy_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];subxy_#t~malloc4.base, subxy_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;subxy_~z~0.base, subxy_~z~0.offset := subxy_#t~malloc4.base, subxy_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];subxy_#t~malloc5.base, subxy_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;subxy_~i~0.base, subxy_~i~0.offset := subxy_#t~malloc5.base, subxy_#t~malloc5.offset; 108#L552 SUMMARY for call write~int(subxy_~x, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4); srcloc: L552 114#L552-1 SUMMARY for call write~int(subxy_~y, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); srcloc: L552-1 117#L553 SUMMARY for call write~int(0, subxy_~z~0.base, subxy_~z~0.offset, 4); srcloc: L553 127#L554 SUMMARY for call subxy_#t~mem6 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4); srcloc: L554 102#L555 SUMMARY for call write~int(subxy_#t~mem6, subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L555 103#L555-1 havoc subxy_#t~mem6; 104#L556 SUMMARY for call subxy_#t~mem7 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); srcloc: L556 124#L556-1 subxy_#t~short9 := subxy_#t~mem7 <= 0; 125#L556-2 assume !subxy_#t~short9; 112#L556-4 SUMMARY for call subxy_#t~mem8 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4); srcloc: L556-4 113#L556-5 subxy_#t~short9 := subxy_#t~mem8 <= 0; 116#L556-6 assume !subxy_#t~short9;havoc subxy_#t~short9;havoc subxy_#t~mem8;havoc subxy_#t~mem7; 99#L559-4 [2018-11-10 05:19:37,350 INFO L795 eck$LassoCheckResult]: Loop: 99#L559-4 assume true; 96#L559-1 SUMMARY for call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L559-1 97#L559-2 assume !!(subxy_#t~mem10 > 0);havoc subxy_#t~mem10; 101#L560 SUMMARY for call subxy_#t~mem11 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L560 132#L560-1 subxy_#t~post12 := subxy_#t~mem11; 122#L560-2 SUMMARY for call write~int(subxy_#t~post12 - 1, subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L560-2 123#L560-3 havoc subxy_#t~mem11;havoc subxy_#t~post12; 119#L561 SUMMARY for call subxy_#t~mem13 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4); srcloc: L561 120#L561-1 subxy_#t~post14 := subxy_#t~mem13; 121#L561-2 SUMMARY for call write~int(subxy_#t~post14 + 1, subxy_~z~0.base, subxy_~z~0.offset, 4); srcloc: L561-2 98#L561-3 havoc subxy_#t~mem13;havoc subxy_#t~post14; 99#L559-4 [2018-11-10 05:19:37,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:19:37,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1859956366, now seen corresponding path program 1 times [2018-11-10 05:19:37,351 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:19:37,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:19:37,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:37,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:19:37,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:19:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:19:37,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:19:37,418 INFO L82 PathProgramCache]: Analyzing trace with hash -22042653, now seen corresponding path program 2 times [2018-11-10 05:19:37,418 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:19:37,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:19:37,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:37,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:19:37,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:19:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:19:37,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:19:37,435 INFO L82 PathProgramCache]: Analyzing trace with hash -376287434, now seen corresponding path program 1 times [2018-11-10 05:19:37,435 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:19:37,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:19:37,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:37,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:19:37,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:19:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:19:38,144 WARN L179 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 139 [2018-11-10 05:19:38,341 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-11-10 05:19:38,353 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:19:38,354 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:19:38,354 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:19:38,354 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:19:38,354 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:19:38,354 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:19:38,355 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:19:38,355 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:19:38,355 INFO L131 ssoRankerPreferences]: Filename of dumped script: Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 05:19:38,355 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:19:38,355 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:19:38,373 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 05:19:38,377 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 05:19:38,379 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 05:19:38,380 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 05:19:38,382 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 05:19:38,384 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 05:19:38,386 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 05:19:38,388 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 05:19:38,390 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 05:19:38,391 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 05:19:38,393 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 05:19:38,395 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 05:19:38,397 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 05:19:38,399 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 05:19:38,400 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 05:19:38,402 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 05:19:38,404 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 05:19:38,405 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 05:19:38,407 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 05:19:38,409 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 05:19:38,410 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 05:19:38,913 WARN L179 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 119 [2018-11-10 05:19:38,995 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 05:19:38,997 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 05:19:38,998 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 05:19:38,999 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 05:19:39,000 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 05:19:39,001 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 05:19:39,002 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 05:19:39,003 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 05:19:39,004 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 05:19:39,418 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:19:39,422 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:19:39,423 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 05:19:39,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:39,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:39,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:39,429 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,429 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 05:19:39,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:39,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:39,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:39,431 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,432 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 05:19:39,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:39,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:39,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:39,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,434 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 05:19:39,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:39,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:39,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:39,436 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,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 05:19:39,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:39,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:39,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:39,439 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,439 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 05:19:39,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:39,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:39,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:39,441 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,441 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 05:19:39,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:39,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:39,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:39,444 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,444 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 05:19:39,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:39,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:39,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:39,446 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,447 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 05:19:39,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:39,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:39,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:39,448 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,449 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 05:19:39,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:39,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:39,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:39,451 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,451 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 05:19:39,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:19:39,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:39,455 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,456 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 05:19:39,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:19:39,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:39,460 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,460 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 05:19:39,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,462 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:19:39,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:39,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,467 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 05:19:39,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:39,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:39,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:39,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,469 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 05:19:39,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:19:39,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:39,473 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,474 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 05:19:39,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:39,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:39,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:39,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,476 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 05:19:39,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:39,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:39,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:39,478 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,479 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 05:19:39,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:19:39,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:39,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,483 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 05:19:39,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:19:39,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:39,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,488 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 05:19:39,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:39,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:39,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:39,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,490 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 05:19:39,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,491 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:19:39,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,492 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:19:39,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:39,501 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,501 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 05:19:39,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:19:39,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:39,506 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,506 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 05:19:39,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,507 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:19:39,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,508 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:19:39,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:39,516 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,516 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 05:19:39,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,517 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:19:39,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,519 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:19:39,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:39,524 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,524 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 05:19:39,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:19:39,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:39,530 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,530 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 05:19:39,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:19:39,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:39,560 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:39,561 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 05:19:39,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:39,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:39,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:39,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:39,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:19:39,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:39,579 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:19:39,595 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 05:19:39,595 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 05:19:39,598 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:19:39,599 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:19:39,599 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:19:39,600 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_1 Supporting invariants [] [2018-11-10 05:19:39,710 INFO L297 tatePredicateManager]: 33 out of 36 supporting invariants were superfluous and have been removed [2018-11-10 05:19:39,722 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:19:39,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:19:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:19:39,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:19:39,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-10 05:19:39,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-10 05:19:39,815 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:39,816 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:39,817 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:39,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-10 05:19:39,819 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 05:19:39,824 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:19:39,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:19:39,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:19:39,839 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:12 [2018-11-10 05:19:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:19:39,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:19:39,927 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:39,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-10 05:19:39,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-10 05:19:39,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:19:39,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:19:39,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:19:39,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:23 [2018-11-10 05:19:39,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:39,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-10 05:19:39,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 05:19:39,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:19:39,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:19:39,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:19:39,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:23 [2018-11-10 05:19:39,989 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 05:19:39,991 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-10 05:19:39,992 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 38 transitions. cyclomatic complexity: 3 Second operand 9 states. [2018-11-10 05:19:40,125 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 38 transitions. cyclomatic complexity: 3. Second operand 9 states. Result 63 states and 65 transitions. Complement of second has 14 states. [2018-11-10 05:19:40,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 05:19:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 05:19:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2018-11-10 05:19:40,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 14 letters. Loop has 11 letters. [2018-11-10 05:19:40,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:19:40,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 25 letters. Loop has 11 letters. [2018-11-10 05:19:40,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:19:40,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 14 letters. Loop has 22 letters. [2018-11-10 05:19:40,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:19:40,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2018-11-10 05:19:40,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 05:19:40,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 53 states and 55 transitions. [2018-11-10 05:19:40,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-10 05:19:40,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-10 05:19:40,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 55 transitions. [2018-11-10 05:19:40,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:19:40,134 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-11-10 05:19:40,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 55 transitions. [2018-11-10 05:19:40,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2018-11-10 05:19:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 05:19:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-11-10 05:19:40,138 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-11-10 05:19:40,138 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-11-10 05:19:40,138 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:19:40,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 47 transitions. [2018-11-10 05:19:40,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 05:19:40,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:19:40,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:19:40,140 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:19:40,140 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:19:40,140 INFO L793 eck$LassoCheckResult]: Stem: 502#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 475#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet22;havoc main_#t~nondet22;main_~y~0 := main_#t~nondet23;havoc main_#t~nondet23;assume { :begin_inline_subxy } true;subxy_#in~x, subxy_#in~y := main_~x~0, main_~y~0;havoc subxy_#res;havoc subxy_#t~malloc2.base, subxy_#t~malloc2.offset, subxy_#t~malloc3.base, subxy_#t~malloc3.offset, subxy_#t~malloc4.base, subxy_#t~malloc4.offset, subxy_#t~malloc5.base, subxy_#t~malloc5.offset, subxy_#t~mem6, subxy_#t~mem7, subxy_#t~mem8, subxy_#t~short9, subxy_#t~mem11, subxy_#t~post12, subxy_#t~mem13, subxy_#t~post14, subxy_#t~mem10, subxy_#t~mem17, subxy_#t~post18, subxy_#t~mem19, subxy_#t~post20, subxy_#t~mem15, subxy_#t~mem16, subxy_#t~mem21, subxy_~x, subxy_~y, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, subxy_~z~0.base, subxy_~z~0.offset, subxy_~i~0.base, subxy_~i~0.offset;subxy_~x := subxy_#in~x;subxy_~y := subxy_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];subxy_#t~malloc2.base, subxy_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;subxy_~x_ref~0.base, subxy_~x_ref~0.offset := subxy_#t~malloc2.base, subxy_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];subxy_#t~malloc3.base, subxy_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;subxy_~y_ref~0.base, subxy_~y_ref~0.offset := subxy_#t~malloc3.base, subxy_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];subxy_#t~malloc4.base, subxy_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;subxy_~z~0.base, subxy_~z~0.offset := subxy_#t~malloc4.base, subxy_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];subxy_#t~malloc5.base, subxy_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;subxy_~i~0.base, subxy_~i~0.offset := subxy_#t~malloc5.base, subxy_#t~malloc5.offset; 476#L552 SUMMARY for call write~int(subxy_~x, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4); srcloc: L552 482#L552-1 SUMMARY for call write~int(subxy_~y, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); srcloc: L552-1 485#L553 SUMMARY for call write~int(0, subxy_~z~0.base, subxy_~z~0.offset, 4); srcloc: L553 499#L554 SUMMARY for call subxy_#t~mem6 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4); srcloc: L554 470#L555 SUMMARY for call write~int(subxy_#t~mem6, subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L555 471#L555-1 havoc subxy_#t~mem6; 472#L556 SUMMARY for call subxy_#t~mem7 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); srcloc: L556 496#L556-1 subxy_#t~short9 := subxy_#t~mem7 <= 0; 497#L556-2 assume !subxy_#t~short9; 480#L556-4 SUMMARY for call subxy_#t~mem8 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4); srcloc: L556-4 481#L556-5 subxy_#t~short9 := subxy_#t~mem8 <= 0; 484#L556-6 assume !subxy_#t~short9;havoc subxy_#t~short9;havoc subxy_#t~mem8;havoc subxy_#t~mem7; 491#L559-4 assume true; 460#L559-1 SUMMARY for call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L559-1 461#L559-2 assume !(subxy_#t~mem10 > 0);havoc subxy_#t~mem10; 468#L563-4 [2018-11-10 05:19:40,141 INFO L795 eck$LassoCheckResult]: Loop: 468#L563-4 assume true; 477#L563 SUMMARY for call subxy_#t~mem15 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L563 478#L563-1 SUMMARY for call subxy_#t~mem16 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); srcloc: L563-1 483#L563-2 assume !!(subxy_#t~mem15 < subxy_#t~mem16);havoc subxy_#t~mem16;havoc subxy_#t~mem15; 486#L564 SUMMARY for call subxy_#t~mem17 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L564 500#L564-1 subxy_#t~post18 := subxy_#t~mem17; 501#L564-2 SUMMARY for call write~int(subxy_#t~post18 + 1, subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L564-2 503#L564-3 havoc subxy_#t~mem17;havoc subxy_#t~post18; 498#L565 SUMMARY for call subxy_#t~mem19 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4); srcloc: L565 473#L565-1 subxy_#t~post20 := subxy_#t~mem19; 474#L565-2 SUMMARY for call write~int(subxy_#t~post20 - 1, subxy_~z~0.base, subxy_~z~0.offset, 4); srcloc: L565-2 479#L565-3 havoc subxy_#t~mem19;havoc subxy_#t~post20; 468#L563-4 [2018-11-10 05:19:40,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:19:40,141 INFO L82 PathProgramCache]: Analyzing trace with hash 587040688, now seen corresponding path program 1 times [2018-11-10 05:19:40,141 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:19:40,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:19:40,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:40,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:19:40,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:19:40,255 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 05:19:40,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:19:40,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 05:19:40,256 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:19:40,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:19:40,256 INFO L82 PathProgramCache]: Analyzing trace with hash 326846444, now seen corresponding path program 1 times [2018-11-10 05:19:40,256 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:19:40,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:19:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:40,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:19:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:19:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:19:40,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:19:40,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:19:40,338 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. cyclomatic complexity: 4 Second operand 9 states. [2018-11-10 05:19:40,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:19:40,503 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-10 05:19:40,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 05:19:40,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 53 transitions. [2018-11-10 05:19:40,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 05:19:40,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 50 states and 51 transitions. [2018-11-10 05:19:40,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-10 05:19:40,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-10 05:19:40,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 51 transitions. [2018-11-10 05:19:40,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:19:40,506 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-11-10 05:19:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 51 transitions. [2018-11-10 05:19:40,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2018-11-10 05:19:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 05:19:40,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-10 05:19:40,509 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-10 05:19:40,509 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-10 05:19:40,509 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:19:40,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 46 transitions. [2018-11-10 05:19:40,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 05:19:40,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:19:40,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:19:40,512 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:19:40,512 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:19:40,512 INFO L793 eck$LassoCheckResult]: Stem: 620#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 593#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet22;havoc main_#t~nondet22;main_~y~0 := main_#t~nondet23;havoc main_#t~nondet23;assume { :begin_inline_subxy } true;subxy_#in~x, subxy_#in~y := main_~x~0, main_~y~0;havoc subxy_#res;havoc subxy_#t~malloc2.base, subxy_#t~malloc2.offset, subxy_#t~malloc3.base, subxy_#t~malloc3.offset, subxy_#t~malloc4.base, subxy_#t~malloc4.offset, subxy_#t~malloc5.base, subxy_#t~malloc5.offset, subxy_#t~mem6, subxy_#t~mem7, subxy_#t~mem8, subxy_#t~short9, subxy_#t~mem11, subxy_#t~post12, subxy_#t~mem13, subxy_#t~post14, subxy_#t~mem10, subxy_#t~mem17, subxy_#t~post18, subxy_#t~mem19, subxy_#t~post20, subxy_#t~mem15, subxy_#t~mem16, subxy_#t~mem21, subxy_~x, subxy_~y, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, subxy_~z~0.base, subxy_~z~0.offset, subxy_~i~0.base, subxy_~i~0.offset;subxy_~x := subxy_#in~x;subxy_~y := subxy_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];subxy_#t~malloc2.base, subxy_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;subxy_~x_ref~0.base, subxy_~x_ref~0.offset := subxy_#t~malloc2.base, subxy_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];subxy_#t~malloc3.base, subxy_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;subxy_~y_ref~0.base, subxy_~y_ref~0.offset := subxy_#t~malloc3.base, subxy_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];subxy_#t~malloc4.base, subxy_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;subxy_~z~0.base, subxy_~z~0.offset := subxy_#t~malloc4.base, subxy_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];subxy_#t~malloc5.base, subxy_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;subxy_~i~0.base, subxy_~i~0.offset := subxy_#t~malloc5.base, subxy_#t~malloc5.offset; 594#L552 SUMMARY for call write~int(subxy_~x, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4); srcloc: L552 600#L552-1 SUMMARY for call write~int(subxy_~y, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); srcloc: L552-1 604#L553 SUMMARY for call write~int(0, subxy_~z~0.base, subxy_~z~0.offset, 4); srcloc: L553 618#L554 SUMMARY for call subxy_#t~mem6 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4); srcloc: L554 589#L555 SUMMARY for call write~int(subxy_#t~mem6, subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L555 590#L555-1 havoc subxy_#t~mem6; 592#L556 SUMMARY for call subxy_#t~mem7 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); srcloc: L556 615#L556-1 subxy_#t~short9 := subxy_#t~mem7 <= 0; 616#L556-2 assume !subxy_#t~short9; 601#L556-4 SUMMARY for call subxy_#t~mem8 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4); srcloc: L556-4 602#L556-5 subxy_#t~short9 := subxy_#t~mem8 <= 0; 605#L556-6 assume !subxy_#t~short9;havoc subxy_#t~short9;havoc subxy_#t~mem8;havoc subxy_#t~mem7; 591#L559-4 assume true; 581#L559-1 SUMMARY for call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L559-1 582#L559-2 assume !!(subxy_#t~mem10 > 0);havoc subxy_#t~mem10; 588#L560 SUMMARY for call subxy_#t~mem11 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L560 623#L560-1 subxy_#t~post12 := subxy_#t~mem11; 613#L560-2 SUMMARY for call write~int(subxy_#t~post12 - 1, subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L560-2 614#L560-3 havoc subxy_#t~mem11;havoc subxy_#t~post12; 606#L561 SUMMARY for call subxy_#t~mem13 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4); srcloc: L561 607#L561-1 subxy_#t~post14 := subxy_#t~mem13; 611#L561-2 SUMMARY for call write~int(subxy_#t~post14 + 1, subxy_~z~0.base, subxy_~z~0.offset, 4); srcloc: L561-2 583#L561-3 havoc subxy_#t~mem13;havoc subxy_#t~post14; 584#L559-4 assume true; 579#L559-1 SUMMARY for call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L559-1 580#L559-2 assume !(subxy_#t~mem10 > 0);havoc subxy_#t~mem10; 587#L563-4 [2018-11-10 05:19:40,512 INFO L795 eck$LassoCheckResult]: Loop: 587#L563-4 assume true; 597#L563 SUMMARY for call subxy_#t~mem15 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L563 598#L563-1 SUMMARY for call subxy_#t~mem16 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); srcloc: L563-1 603#L563-2 assume !!(subxy_#t~mem15 < subxy_#t~mem16);havoc subxy_#t~mem16;havoc subxy_#t~mem15; 610#L564 SUMMARY for call subxy_#t~mem17 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L564 619#L564-1 subxy_#t~post18 := subxy_#t~mem17; 621#L564-2 SUMMARY for call write~int(subxy_#t~post18 + 1, subxy_~i~0.base, subxy_~i~0.offset, 4); srcloc: L564-2 622#L564-3 havoc subxy_#t~mem17;havoc subxy_#t~post18; 617#L565 SUMMARY for call subxy_#t~mem19 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4); srcloc: L565 595#L565-1 subxy_#t~post20 := subxy_#t~mem19; 596#L565-2 SUMMARY for call write~int(subxy_#t~post20 - 1, subxy_~z~0.base, subxy_~z~0.offset, 4); srcloc: L565-2 599#L565-3 havoc subxy_#t~mem19;havoc subxy_#t~post20; 587#L563-4 [2018-11-10 05:19:40,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:19:40,512 INFO L82 PathProgramCache]: Analyzing trace with hash -114276856, now seen corresponding path program 1 times [2018-11-10 05:19:40,512 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:19:40,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:19:40,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:40,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:19:40,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:19:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:19:40,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:19:40,543 INFO L82 PathProgramCache]: Analyzing trace with hash 326846444, now seen corresponding path program 2 times [2018-11-10 05:19:40,544 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:19:40,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:19:40,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:40,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:19:40,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:19:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:19:40,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:19:40,554 INFO L82 PathProgramCache]: Analyzing trace with hash 503823219, now seen corresponding path program 1 times [2018-11-10 05:19:40,554 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:19:40,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:19:40,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:40,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:19:40,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:19:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:19:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:19:41,550 WARN L179 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 163 [2018-11-10 05:19:41,790 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-11-10 05:19:41,792 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:19:41,792 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:19:41,792 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:19:41,792 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:19:41,792 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:19:41,792 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:19:41,792 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:19:41,792 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:19:41,793 INFO L131 ssoRankerPreferences]: Filename of dumped script: Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-10 05:19:41,793 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:19:41,793 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:19:41,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 05:19:41,798 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 05:19:41,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 05:19:41,801 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 05:19:41,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 05:19:41,803 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 05:19:41,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 05:19:41,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 05:19:41,806 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 05:19:41,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 05:19:41,809 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 05:19:41,810 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 05:19:41,812 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 05:19:41,813 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 05:19:41,815 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 05:19:41,816 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 05:19:41,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 05:19:41,818 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 05:19:42,279 WARN L179 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 129 [2018-11-10 05:19:42,389 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2018-11-10 05:19:42,390 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 05:19:42,391 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 05:19:42,393 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 05:19:42,394 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 05:19:42,395 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 05:19:42,396 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 05:19:42,397 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 05:19:42,398 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 05:19:42,400 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 05:19:42,556 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-11-10 05:19:42,927 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:19:42,927 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:19:42,927 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 05:19:42,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:42,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:42,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:42,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:42,930 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,930 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 05:19:42,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:42,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:42,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:42,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:42,932 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,932 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 05:19:42,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:42,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:42,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:42,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:42,933 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,934 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 05:19:42,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:42,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:42,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:42,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:42,935 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,935 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 05:19:42,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:42,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:42,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:42,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:42,936 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,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 05:19:42,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:42,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:42,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:42,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:42,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,937 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 05:19:42,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:42,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:42,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:42,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:42,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,939 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 05:19:42,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:42,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:19:42,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:42,942 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,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 05:19:42,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:42,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:42,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:42,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:42,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,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 05:19:42,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:42,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:19:42,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:42,947 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,947 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 05:19:42,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:42,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:42,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:42,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:42,949 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,949 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 05:19:42,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:42,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:42,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:42,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:42,950 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,951 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 05:19:42,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:42,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:42,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:42,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:42,952 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,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 05:19:42,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:42,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:19:42,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:42,955 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,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 05:19:42,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:42,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:42,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:42,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:42,957 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,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 05:19:42,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:42,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:42,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:42,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:42,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,959 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 05:19:42,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:19:42,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:42,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:19:42,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:19:42,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,961 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 05:19:42,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,961 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:19:42,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,962 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:19:42,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:42,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,967 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 05:19:42,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:42,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:19:42,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:42,991 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,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 05:19:42,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,992 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:19:42,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,993 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:19:42,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:42,995 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:19:42,996 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 05:19:42,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:19:42,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:19:42,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:19:42,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:19:42,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:19:42,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:19:43,009 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:19:43,019 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 05:19:43,020 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 05:19:43,020 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:19:43,021 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:19:43,022 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:19:43,023 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_subxy_~y_ref~0.base) ULTIMATE.start_subxy_~y_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~y_ref~0.base) ULTIMATE.start_subxy_~y_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_2 Supporting invariants [] [2018-11-10 05:19:43,190 INFO L297 tatePredicateManager]: 34 out of 37 supporting invariants were superfluous and have been removed [2018-11-10 05:19:43,194 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:19:43,195 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:19:43,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:19:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:19:43,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:19:43,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-10 05:19:43,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-10 05:19:43,239 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:43,240 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:43,241 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:43,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-10 05:19:43,242 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 05:19:43,246 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:19:43,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:19:43,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:19:43,254 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:12 [2018-11-10 05:19:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:19:43,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:19:43,363 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:43,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2018-11-10 05:19:43,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2018-11-10 05:19:43,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:19:43,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:43,400 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:43,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:43,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-11-10 05:19:43,404 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 05:19:43,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 05:19:43,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 05:19:43,439 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:57, output treesize:70 [2018-11-10 05:19:43,546 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:43,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:43,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 75 [2018-11-10 05:19:43,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 59 [2018-11-10 05:19:43,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:19:43,602 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:43,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 65 [2018-11-10 05:19:43,612 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 05:19:43,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 05:19:43,699 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:43,701 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:43,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-11-10 05:19:43,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-10 05:19:43,706 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 05:19:43,745 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:19:43,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 05:19:43,791 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:110, output treesize:138 [2018-11-10 05:19:43,807 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 05:19:43,808 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 05:19:43,808 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 46 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-10 05:19:43,883 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 46 transitions. cyclomatic complexity: 3. Second operand 12 states. Result 65 states and 66 transitions. Complement of second has 16 states. [2018-11-10 05:19:43,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 05:19:43,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 05:19:43,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2018-11-10 05:19:43,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 28 letters. Loop has 12 letters. [2018-11-10 05:19:43,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:19:43,885 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:19:43,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:19:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:19:43,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:19:43,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-10 05:19:43,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-10 05:19:43,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:43,943 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:43,944 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:43,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-10 05:19:43,945 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 05:19:43,949 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:19:43,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:19:43,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:19:43,959 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:12 [2018-11-10 05:19:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:19:43,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:19:44,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:44,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2018-11-10 05:19:44,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2018-11-10 05:19:44,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:19:44,099 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:44,100 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:44,100 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:44,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-11-10 05:19:44,103 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 05:19:44,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 05:19:44,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 05:19:44,135 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:57, output treesize:70 [2018-11-10 05:19:44,241 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:44,248 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:44,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 75 [2018-11-10 05:19:44,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 73 [2018-11-10 05:19:44,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-10 05:19:44,373 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:44,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2018-11-10 05:19:44,374 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 05:19:44,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 05:19:44,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:44,463 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:19:44,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-11-10 05:19:44,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-10 05:19:44,467 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 05:19:44,478 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:19:44,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 05:19:44,533 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:110, output treesize:138 [2018-11-10 05:19:44,555 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 05:19:44,555 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 05:19:44,555 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 46 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-10 05:19:44,755 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 46 transitions. cyclomatic complexity: 3. Second operand 12 states. Result 57 states and 59 transitions. Complement of second has 21 states. [2018-11-10 05:19:44,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-10 05:19:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 05:19:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2018-11-10 05:19:44,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 38 transitions. Stem has 28 letters. Loop has 12 letters. [2018-11-10 05:19:44,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:19:44,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 38 transitions. Stem has 40 letters. Loop has 12 letters. [2018-11-10 05:19:44,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:19:44,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 38 transitions. Stem has 28 letters. Loop has 24 letters. [2018-11-10 05:19:44,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:19:44,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 59 transitions. [2018-11-10 05:19:44,758 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:19:44,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 0 states and 0 transitions. [2018-11-10 05:19:44,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:19:44,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:19:44,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:19:44,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:19:44,758 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:19:44,758 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:19:44,759 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:19:44,759 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 05:19:44,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:19:44,759 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:19:44,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:19:44,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:19:44 BoogieIcfgContainer [2018-11-10 05:19:44,763 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:19:44,763 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:19:44,763 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:19:44,764 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:19:44,764 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:19:36" (3/4) ... [2018-11-10 05:19:44,766 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:19:44,766 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:19:44,767 INFO L168 Benchmark]: Toolchain (without parser) took 8652.84 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 385.4 MB). Free memory was 957.1 MB in the beginning and 1.3 GB in the end (delta: -322.6 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:19:44,767 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:19:44,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.36 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 935.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:19:44,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 935.7 MB in the beginning and 1.2 GB in the end (delta: -236.7 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:19:44,768 INFO L168 Benchmark]: Boogie Preprocessor took 18.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:19:44,768 INFO L168 Benchmark]: RCFGBuilder took 297.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:19:44,769 INFO L168 Benchmark]: BuchiAutomizer took 7927.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 210.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -140.4 MB). Peak memory consumption was 70.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:19:44,769 INFO L168 Benchmark]: Witness Printer took 2.89 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:19:44,772 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.36 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 935.7 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 81.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 935.7 MB in the beginning and 1.2 GB in the end (delta: -236.7 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 297.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7927.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 210.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -140.4 MB). Peak memory consumption was 70.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.89 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[i][i] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[i][i] and consists of 12 locations. 2 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.8s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 5.5s. Construction of modules took 0.2s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 2. Nontrivial modules had stage [1, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 132 SDtfs, 152 SDslu, 171 SDs, 0 SdLazy, 261 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital786 mio100 ax102 hnf100 lsp95 ukn41 mio100 lsp32 div100 bol100 ite100 ukn100 eq189 hnf88 smp91 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...