./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-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_d4f7389e-1b80-4600-b784-b31f1726d508/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d4f7389e-1b80-4600-b784-b31f1726d508/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d4f7389e-1b80-4600-b784-b31f1726d508/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d4f7389e-1b80-4600-b784-b31f1726d508/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d4f7389e-1b80-4600-b784-b31f1726d508/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d4f7389e-1b80-4600-b784-b31f1726d508/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 cb5770b8d32c05b82025135c2b222cf31b0a4100 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:09:17,755 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:09:17,757 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:09:17,767 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:09:17,767 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:09:17,768 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:09:17,769 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:09:17,770 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:09:17,772 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:09:17,772 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:09:17,773 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:09:17,773 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:09:17,774 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:09:17,775 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:09:17,776 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:09:17,776 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:09:17,777 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:09:17,778 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:09:17,780 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:09:17,781 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:09:17,782 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:09:17,783 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:09:17,785 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:09:17,785 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:09:17,785 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:09:17,786 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:09:17,786 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:09:17,787 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:09:17,788 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:09:17,788 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:09:17,789 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:09:17,789 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:09:17,790 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:09:17,790 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:09:17,790 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:09:17,791 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:09:17,791 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d4f7389e-1b80-4600-b784-b31f1726d508/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:09:17,805 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:09:17,805 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:09:17,809 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:09:17,810 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:09:17,810 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:09:17,810 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:09:17,810 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:09:17,810 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:09:17,811 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:09:17,811 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:09:17,811 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:09:17,811 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:09:17,811 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:09:17,811 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:09:17,811 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:09:17,812 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:09:17,812 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:09:17,812 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:09:17,812 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:09:17,812 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:09:17,812 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:09:17,813 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:09:17,813 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:09:17,813 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:09:17,813 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:09:17,813 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:09:17,813 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:09:17,814 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:09:17,814 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_d4f7389e-1b80-4600-b784-b31f1726d508/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 -> cb5770b8d32c05b82025135c2b222cf31b0a4100 [2018-10-27 06:09:17,839 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:09:17,850 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:09:17,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:09:17,855 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:09:17,855 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:09:17,856 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d4f7389e-1b80-4600-b784-b31f1726d508/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2018-10-27 06:09:17,909 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d4f7389e-1b80-4600-b784-b31f1726d508/bin-2019/uautomizer/data/8e4b31ff8/1dbcbf05e9344da9ad30555c99c4ba77/FLAG563d0871c [2018-10-27 06:09:18,328 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:09:18,328 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d4f7389e-1b80-4600-b784-b31f1726d508/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2018-10-27 06:09:18,338 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d4f7389e-1b80-4600-b784-b31f1726d508/bin-2019/uautomizer/data/8e4b31ff8/1dbcbf05e9344da9ad30555c99c4ba77/FLAG563d0871c [2018-10-27 06:09:18,349 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d4f7389e-1b80-4600-b784-b31f1726d508/bin-2019/uautomizer/data/8e4b31ff8/1dbcbf05e9344da9ad30555c99c4ba77 [2018-10-27 06:09:18,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:09:18,352 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:09:18,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:18,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:09:18,356 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:09:18,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:18" (1/1) ... [2018-10-27 06:09:18,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49cb25ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:18, skipping insertion in model container [2018-10-27 06:09:18,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:18" (1/1) ... [2018-10-27 06:09:18,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:09:18,402 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:09:18,622 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:18,631 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:09:18,666 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:18,703 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:09:18,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:18 WrapperNode [2018-10-27 06:09:18,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:18,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:18,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:09:18,705 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:09:18,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:18" (1/1) ... [2018-10-27 06:09:18,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:18" (1/1) ... [2018-10-27 06:09:18,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:18,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:09:18,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:09:18,815 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:09:18,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:18" (1/1) ... [2018-10-27 06:09:18,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:18" (1/1) ... [2018-10-27 06:09:18,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:18" (1/1) ... [2018-10-27 06:09:18,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:18" (1/1) ... [2018-10-27 06:09:18,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:18" (1/1) ... [2018-10-27 06:09:18,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:18" (1/1) ... [2018-10-27 06:09:18,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:18" (1/1) ... [2018-10-27 06:09:18,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:09:18,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:09:18,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:09:18,853 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:09:18,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4f7389e-1b80-4600-b784-b31f1726d508/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-10-27 06:09:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:09:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:09:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:09:18,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:09:19,767 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:09:19,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:19 BoogieIcfgContainer [2018-10-27 06:09:19,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:09:19,768 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:09:19,768 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:09:19,773 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:09:19,774 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:19,774 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:09:18" (1/3) ... [2018-10-27 06:09:19,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58eb34de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:09:19, skipping insertion in model container [2018-10-27 06:09:19,777 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:19,777 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:18" (2/3) ... [2018-10-27 06:09:19,777 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58eb34de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:09:19, skipping insertion in model container [2018-10-27 06:09:19,777 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:19,777 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:19" (3/3) ... [2018-10-27 06:09:19,779 INFO L375 chiAutomizerObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2018-10-27 06:09:19,888 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:09:19,899 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:09:19,899 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:09:19,899 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:09:19,899 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:09:19,900 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:09:19,900 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:09:19,900 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:09:19,900 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:09:19,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states. [2018-10-27 06:09:19,976 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 56 [2018-10-27 06:09:19,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:19,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:19,994 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:20,002 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:20,002 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:09:20,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states. [2018-10-27 06:09:20,012 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 56 [2018-10-27 06:09:20,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:20,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:20,013 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:20,013 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:20,020 INFO L793 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet21; 25#L578true assume !(main_#t~nondet21 != 0);havoc main_#t~nondet21;assume { :begin_inline_f } true;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;#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];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#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];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#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];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#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];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.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];f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset; 35#L553-2true SUMMARY for call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L553-2 36#L553-3true SUMMARY for call write~int(1, f_~x~0.base, f_~x~0.offset, 4); srcloc: L553-3 44#L554-1true SUMMARY for call write~int(1, f_~y~0.base, f_~y~0.offset, 4); srcloc: L554-1 11#L555-1true SUMMARY for call write~int(1, f_~k~0.base, f_~k~0.offset, 4); srcloc: L555-1 30#L556-1true SUMMARY for call write~int(1, f_~z~0.base, f_~z~0.offset, 4); srcloc: L556-1 42#L557-1true SUMMARY for call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L557-1 57#L558-1true assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 45#L562-9true [2018-10-27 06:09:20,020 INFO L795 eck$LassoCheckResult]: Loop: 45#L562-9true assume true; 58#L562-5true SUMMARY for call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4); srcloc: L562-5 63#L562-6true SUMMARY for call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L562-6 67#L562-7true assume !!(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 20#L563-3true SUMMARY for call f_#t~mem10 := read~int(f_~z~0.base, f_~z~0.offset, 4); srcloc: L563-3 22#L563-4true SUMMARY for call write~int(2 * f_#t~mem10, f_~z~0.base, f_~z~0.offset, 4); srcloc: L563-4 4#L563-5true havoc f_#t~mem10; 45#L562-9true [2018-10-27 06:09:20,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:20,031 INFO L82 PathProgramCache]: Analyzing trace with hash 534094155, now seen corresponding path program 1 times [2018-10-27 06:09:20,033 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:20,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:20,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:20,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:20,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:20,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:20,266 INFO L82 PathProgramCache]: Analyzing trace with hash -350861566, now seen corresponding path program 1 times [2018-10-27 06:09:20,266 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:20,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:20,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:20,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:20,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:20,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:20,310 INFO L82 PathProgramCache]: Analyzing trace with hash -437223816, now seen corresponding path program 1 times [2018-10-27 06:09:20,311 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:20,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:20,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:20,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:20,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:20,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:20,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 06:09:20,928 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-27 06:09:21,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 06:09:21,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:09:21,037 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 9 states. [2018-10-27 06:09:21,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:21,758 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-10-27 06:09:21,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 06:09:21,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 120 transitions. [2018-10-27 06:09:21,766 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-10-27 06:09:21,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 95 states and 104 transitions. [2018-10-27 06:09:21,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2018-10-27 06:09:21,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2018-10-27 06:09:21,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 104 transitions. [2018-10-27 06:09:21,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:09:21,774 INFO L705 BuchiCegarLoop]: Abstraction has 95 states and 104 transitions. [2018-10-27 06:09:21,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 104 transitions. [2018-10-27 06:09:21,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 67. [2018-10-27 06:09:21,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-27 06:09:21,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-10-27 06:09:21,805 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-10-27 06:09:21,806 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-10-27 06:09:21,806 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:09:21,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 72 transitions. [2018-10-27 06:09:21,808 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-10-27 06:09:21,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:21,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:21,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:21,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:21,810 INFO L793 eck$LassoCheckResult]: Stem: 242#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 225#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet21; 226#L578 assume !(main_#t~nondet21 != 0);havoc main_#t~nondet21;assume { :begin_inline_f } true;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;#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];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#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];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#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];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#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];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.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];f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset; 233#L553-2 SUMMARY for call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L553-2 244#L553-3 SUMMARY for call write~int(1, f_~x~0.base, f_~x~0.offset, 4); srcloc: L553-3 245#L554-1 SUMMARY for call write~int(1, f_~y~0.base, f_~y~0.offset, 4); srcloc: L554-1 220#L555-1 SUMMARY for call write~int(1, f_~k~0.base, f_~k~0.offset, 4); srcloc: L555-1 221#L556-1 SUMMARY for call write~int(1, f_~z~0.base, f_~z~0.offset, 4); srcloc: L556-1 240#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L557-1 250#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 254#L562-9 assume true; 255#L562-5 SUMMARY for call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4); srcloc: L562-5 263#L562-6 SUMMARY for call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L562-6 266#L562-7 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 227#L567-5 [2018-10-27 06:09:21,810 INFO L795 eck$LassoCheckResult]: Loop: 227#L567-5 assume true; 228#L566-9 SUMMARY for call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4); srcloc: L566-9 262#L566-10 f_#t~short13 := f_#t~mem11 > 0; 265#L566-11 assume !f_#t~short13; 253#L566-15 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~mem12;havoc f_#t~short13; 222#L567-3 assume !(f_#t~nondet14 != 0);havoc f_#t~nondet14; 223#L573-4 SUMMARY for call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4); srcloc: L573-4 256#L573-5 SUMMARY for call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L573-5 260#L573-6 SUMMARY for call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4); srcloc: L573-6 264#L573-7 havoc f_#t~mem20;havoc f_#t~mem19; 227#L567-5 [2018-10-27 06:09:21,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:21,810 INFO L82 PathProgramCache]: Analyzing trace with hash 241902512, now seen corresponding path program 1 times [2018-10-27 06:09:21,811 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:21,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:21,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:21,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:21,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:21,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:21,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1694944539, now seen corresponding path program 1 times [2018-10-27 06:09:21,874 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:21,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:21,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:21,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:21,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:21,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:21,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:09:21,901 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:09:21,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:09:21,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:09:21,902 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-10-27 06:09:21,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:21,931 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-10-27 06:09:21,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:09:21,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 72 transitions. [2018-10-27 06:09:21,934 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-10-27 06:09:21,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 67 states and 70 transitions. [2018-10-27 06:09:21,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2018-10-27 06:09:21,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2018-10-27 06:09:21,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 70 transitions. [2018-10-27 06:09:21,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:09:21,936 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-10-27 06:09:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 70 transitions. [2018-10-27 06:09:21,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-27 06:09:21,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-27 06:09:21,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-10-27 06:09:21,941 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-10-27 06:09:21,941 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-10-27 06:09:21,941 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:09:21,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 70 transitions. [2018-10-27 06:09:21,942 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-10-27 06:09:21,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:21,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:21,943 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:21,943 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:21,943 INFO L793 eck$LassoCheckResult]: Stem: 384#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet21; 365#L578 assume !(main_#t~nondet21 != 0);havoc main_#t~nondet21;assume { :begin_inline_f } true;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;#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];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#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];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#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];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#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];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.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];f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset; 375#L553-2 SUMMARY for call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L553-2 386#L553-3 SUMMARY for call write~int(1, f_~x~0.base, f_~x~0.offset, 4); srcloc: L553-3 387#L554-1 SUMMARY for call write~int(1, f_~y~0.base, f_~y~0.offset, 4); srcloc: L554-1 362#L555-1 SUMMARY for call write~int(1, f_~k~0.base, f_~k~0.offset, 4); srcloc: L555-1 363#L556-1 SUMMARY for call write~int(1, f_~z~0.base, f_~z~0.offset, 4); srcloc: L556-1 382#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L557-1 392#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 394#L562-9 assume true; 395#L562-5 SUMMARY for call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4); srcloc: L562-5 404#L562-6 SUMMARY for call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L562-6 407#L562-7 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 369#L567-5 [2018-10-27 06:09:21,944 INFO L795 eck$LassoCheckResult]: Loop: 369#L567-5 assume true; 370#L566-9 SUMMARY for call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4); srcloc: L566-9 405#L566-10 f_#t~short13 := f_#t~mem11 > 0; 408#L566-11 assume f_#t~short13; 410#L566-12 SUMMARY for call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4); srcloc: L566-12 396#L566-13 f_#t~short13 := f_#t~mem12 > 0; 397#L566-15 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~mem12;havoc f_#t~short13; 366#L567-3 assume !(f_#t~nondet14 != 0);havoc f_#t~nondet14; 367#L573-4 SUMMARY for call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4); srcloc: L573-4 398#L573-5 SUMMARY for call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L573-5 402#L573-6 SUMMARY for call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4); srcloc: L573-6 406#L573-7 havoc f_#t~mem20;havoc f_#t~mem19; 369#L567-5 [2018-10-27 06:09:21,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:21,944 INFO L82 PathProgramCache]: Analyzing trace with hash 241902512, now seen corresponding path program 2 times [2018-10-27 06:09:21,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:21,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:21,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:21,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:21,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:21,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:21,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1785837784, now seen corresponding path program 1 times [2018-10-27 06:09:21,999 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:21,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:22,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:22,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:22,020 INFO L82 PathProgramCache]: Analyzing trace with hash 634506759, now seen corresponding path program 1 times [2018-10-27 06:09:22,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:22,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:22,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:22,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,326 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-10-27 06:09:23,103 WARN L179 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 144 [2018-10-27 06:09:23,657 WARN L179 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-10-27 06:09:23,672 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:23,673 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:23,673 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:23,673 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:23,673 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:23,673 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:23,674 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:23,674 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:23,674 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:09:23,674 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:23,674 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:23,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,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-10-27 06:09:23,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-10-27 06:09:23,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-10-27 06:09:23,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-10-27 06:09:23,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-10-27 06:09:24,552 WARN L179 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 135 [2018-10-27 06:09:24,701 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 97 [2018-10-27 06:09:24,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:25,146 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2018-10-27 06:09:25,566 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:25,571 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:25,573 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-10-27 06:09:25,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:25,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:25,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:25,582 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,583 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-10-27 06:09:25,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:25,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:25,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:25,585 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,585 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-10-27 06:09:25,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,596 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,597 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-10-27 06:09:25,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:25,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:25,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:25,601 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,602 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-10-27 06:09:25,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:25,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:25,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:25,604 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,604 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-10-27 06:09:25,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:25,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:25,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:25,612 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,613 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-10-27 06:09:25,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,621 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-10-27 06:09:25,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,629 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,629 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-10-27 06:09:25,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,636 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-10-27 06:09:25,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:25,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:25,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:25,642 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,642 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-10-27 06:09:25,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:25,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:25,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:25,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:25,652 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:25,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:25,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:25,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:25,654 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:25,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:25,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:25,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:25,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:25,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,672 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-10-27 06:09:25,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:25,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:25,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:25,676 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,676 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-10-27 06:09:25,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,684 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,684 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-10-27 06:09:25,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,696 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,697 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-10-27 06:09:25,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,697 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:25,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,701 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:25,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,709 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,709 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-10-27 06:09:25,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,715 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,715 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-10-27 06:09:25,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,716 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:25,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,718 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:25,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,726 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,726 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-10-27 06:09:25,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,734 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,734 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-10-27 06:09:25,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,735 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:25,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,736 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:25,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,744 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,744 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-10-27 06:09:25,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,753 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-10-27 06:09:25,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,763 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-10-27 06:09:25,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,785 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:25,796 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:09:25,797 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:09:25,799 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:25,801 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-10-27 06:09:25,801 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:25,802 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_1 - 2 >= 0] [2018-10-27 06:09:26,089 INFO L297 tatePredicateManager]: 55 out of 59 supporting invariants were superfluous and have been removed [2018-10-27 06:09:26,098 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:09:26,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:26,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:26,246 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:26,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-10-27 06:09:26,312 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:26,313 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:26,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-10-27 06:09:26,342 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:26,343 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:26,344 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:26,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 64 [2018-10-27 06:09:26,379 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:26,380 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:26,381 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:26,382 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:26,383 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:26,383 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:26,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-10-27 06:09:26,385 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:26,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:26,410 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:26,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:26,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:26,436 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:61, output treesize:51 [2018-10-27 06:09:26,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:09:26,505 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 8 treesize of output 7 [2018-10-27 06:09:26,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:26,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:26,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:26,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:55 [2018-10-27 06:09:26,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:09:26,570 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 8 treesize of output 7 [2018-10-27 06:09:26,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:26,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:26,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:26,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:62 [2018-10-27 06:09:26,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-10-27 06:09:26,752 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 8 treesize of output 7 [2018-10-27 06:09:26,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:26,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:26,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:26,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:73, output treesize:69 [2018-10-27 06:09:26,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2018-10-27 06:09:26,861 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 8 treesize of output 7 [2018-10-27 06:09:26,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:26,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:26,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:26,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:80, output treesize:76 [2018-10-27 06:09:27,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-10-27 06:09:27,019 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 8 treesize of output 7 [2018-10-27 06:09:27,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:27,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:27,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:27,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:87, output treesize:83 [2018-10-27 06:09:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:27,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:27,311 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:27,314 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:27,315 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 51 treesize of output 56 [2018-10-27 06:09:27,374 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:27,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-10-27 06:09:27,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 06:09:27,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:27,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:27,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:34 [2018-10-27 06:09:27,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:27,537 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 7 loop predicates [2018-10-27 06:09:27,538 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 70 transitions. cyclomatic complexity: 5 Second operand 15 states. [2018-10-27 06:09:28,648 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 70 transitions. cyclomatic complexity: 5. Second operand 15 states. Result 98 states and 103 transitions. Complement of second has 21 states. [2018-10-27 06:09:28,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 7 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:28,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-27 06:09:28,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2018-10-27 06:09:28,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 64 transitions. Stem has 14 letters. Loop has 12 letters. [2018-10-27 06:09:28,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:28,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 64 transitions. Stem has 26 letters. Loop has 12 letters. [2018-10-27 06:09:28,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:28,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 64 transitions. Stem has 14 letters. Loop has 24 letters. [2018-10-27 06:09:28,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:28,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 103 transitions. [2018-10-27 06:09:28,657 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-10-27 06:09:28,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 92 states and 97 transitions. [2018-10-27 06:09:28,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2018-10-27 06:09:28,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2018-10-27 06:09:28,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 97 transitions. [2018-10-27 06:09:28,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:28,660 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 97 transitions. [2018-10-27 06:09:28,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 97 transitions. [2018-10-27 06:09:28,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-10-27 06:09:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-27 06:09:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-10-27 06:09:28,666 INFO L728 BuchiCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-10-27 06:09:28,666 INFO L608 BuchiCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-10-27 06:09:28,666 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:09:28,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 93 transitions. [2018-10-27 06:09:28,667 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-10-27 06:09:28,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:28,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:28,667 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:28,667 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:28,668 INFO L793 eck$LassoCheckResult]: Stem: 937#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 917#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet21; 918#L578 assume main_#t~nondet21 != 0;havoc main_#t~nondet21;assume { :begin_inline_f } true;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;#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];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#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];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#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];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#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];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.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];f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset; 928#L553 SUMMARY for call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L553 936#L553-1 SUMMARY for call write~int(1, f_~x~0.base, f_~x~0.offset, 4); srcloc: L553-1 938#L554 SUMMARY for call write~int(1, f_~y~0.base, f_~y~0.offset, 4); srcloc: L554 908#L555 SUMMARY for call write~int(1, f_~k~0.base, f_~k~0.offset, 4); srcloc: L555 909#L556 SUMMARY for call write~int(1, f_~z~0.base, f_~z~0.offset, 4); srcloc: L556 933#L557 SUMMARY for call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L557 943#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 957#L562-4 assume true; 958#L562 SUMMARY for call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4); srcloc: L562 977#L562-1 SUMMARY for call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L562-1 980#L562-2 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 925#L567-2 [2018-10-27 06:09:28,668 INFO L795 eck$LassoCheckResult]: Loop: 925#L567-2 assume true; 906#L566 SUMMARY for call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4); srcloc: L566 907#L566-1 f_#t~short13 := f_#t~mem11 > 0; 910#L566-2 assume f_#t~short13; 974#L566-3 SUMMARY for call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4); srcloc: L566-3 975#L566-4 f_#t~short13 := f_#t~mem12 > 0; 978#L566-6 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~mem12;havoc f_#t~short13; 929#L567 assume !(f_#t~nondet14 != 0);havoc f_#t~nondet14; 930#L573 SUMMARY for call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4); srcloc: L573 976#L573-1 SUMMARY for call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L573-1 979#L573-2 SUMMARY for call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4); srcloc: L573-2 981#L573-3 havoc f_#t~mem20;havoc f_#t~mem19; 925#L567-2 [2018-10-27 06:09:28,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash -160134480, now seen corresponding path program 1 times [2018-10-27 06:09:28,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:28,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:28,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:28,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:28,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:28,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:28,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1383800792, now seen corresponding path program 1 times [2018-10-27 06:09:28,727 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:28,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:28,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:28,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:28,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:28,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:28,745 INFO L82 PathProgramCache]: Analyzing trace with hash -402514937, now seen corresponding path program 1 times [2018-10-27 06:09:28,745 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:28,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:28,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:28,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:28,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:28,929 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-10-27 06:09:29,465 WARN L179 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 138 [2018-10-27 06:09:29,719 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 06:09:29,721 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:29,721 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:29,721 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:29,721 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:29,721 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:29,721 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:29,722 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:29,722 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:29,722 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i_Iteration4_Lasso [2018-10-27 06:09:29,722 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:29,722 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:29,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,424 WARN L179 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 137 [2018-10-27 06:09:30,585 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 97 [2018-10-27 06:09:30,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,422 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:31,422 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:31,422 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-10-27 06:09:31,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,425 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,425 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-10-27 06:09:31,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,430 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-10-27 06:09:31,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,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-10-27 06:09:31,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,448 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,448 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-10-27 06:09:31,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,450 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-10-27 06:09:31,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,459 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,459 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-10-27 06:09:31,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,471 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-10-27 06:09:31,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,473 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,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-10-27 06:09:31,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,480 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-10-27 06:09:31,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,482 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,484 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-10-27 06:09:31,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,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-10-27 06:09:31,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,489 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,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-10-27 06:09:31,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,503 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,504 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-10-27 06:09:31,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,505 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,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-10-27 06:09:31,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,509 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,509 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-10-27 06:09:31,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,519 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,519 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-10-27 06:09:31,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,521 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,521 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-10-27 06:09:31,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,524 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,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-10-27 06:09:31,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,526 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,526 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-10-27 06:09:31,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,541 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,541 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-10-27 06:09:31,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,556 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,556 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-10-27 06:09:31,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,557 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:31,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,558 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:31,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,561 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,562 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-10-27 06:09:31,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,574 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,575 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-10-27 06:09:31,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,578 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,578 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-10-27 06:09:31,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,580 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:31,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,580 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:31,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,584 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,584 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-10-27 06:09:31,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,591 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,591 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-10-27 06:09:31,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,592 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:31,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,593 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:31,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,598 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,598 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-10-27 06:09:31,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,607 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,608 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-10-27 06:09:31,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,612 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,612 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-10-27 06:09:31,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,616 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,617 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-10-27 06:09:31,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,622 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-10-27 06:09:31,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,626 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,627 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-10-27 06:09:31,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,635 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,636 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-10-27 06:09:31,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,636 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:31,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,637 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:31,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,641 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,641 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-10-27 06:09:31,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,646 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,647 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-10-27 06:09:31,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,684 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,697 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,697 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-10-27 06:09:31,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,699 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,710 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:31,720 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-10-27 06:09:31,721 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-10-27 06:09:31,721 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:31,722 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-10-27 06:09:31,722 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:31,733 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_2 - 1 >= 0] [2018-10-27 06:09:32,104 INFO L297 tatePredicateManager]: 55 out of 59 supporting invariants were superfluous and have been removed [2018-10-27 06:09:32,109 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:09:32,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:32,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:32,162 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:32,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-10-27 06:09:32,205 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:32,206 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:32,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-10-27 06:09:32,307 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:32,308 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:32,309 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:32,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 64 [2018-10-27 06:09:32,367 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:32,368 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:32,369 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:32,370 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:32,371 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:32,371 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:32,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-10-27 06:09:32,373 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:32,385 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:32,395 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:32,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:32,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:32,419 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:61, output treesize:51 [2018-10-27 06:09:32,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:09:32,515 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 8 treesize of output 7 [2018-10-27 06:09:32,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:32,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:32,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:32,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:55 [2018-10-27 06:09:32,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:09:32,579 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 8 treesize of output 7 [2018-10-27 06:09:32,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:32,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:32,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:32,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:62 [2018-10-27 06:09:32,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-10-27 06:09:32,695 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 8 treesize of output 7 [2018-10-27 06:09:32,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:32,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:32,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:32,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:73, output treesize:69 [2018-10-27 06:09:32,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2018-10-27 06:09:32,806 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 8 treesize of output 7 [2018-10-27 06:09:32,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:32,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:32,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:32,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:80, output treesize:76 [2018-10-27 06:09:32,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-10-27 06:09:32,918 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 8 treesize of output 7 [2018-10-27 06:09:32,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:32,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:32,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:32,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:87, output treesize:83 [2018-10-27 06:09:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:33,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:33,369 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:33,372 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:33,373 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 51 treesize of output 56 [2018-10-27 06:09:33,380 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:33,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-10-27 06:09:33,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 06:09:33,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:33,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:33,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:34 [2018-10-27 06:09:33,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:33,430 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 7 loop predicates [2018-10-27 06:09:33,430 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 93 transitions. cyclomatic complexity: 8 Second operand 15 states. [2018-10-27 06:09:34,329 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 93 transitions. cyclomatic complexity: 8. Second operand 15 states. Result 142 states and 149 transitions. Complement of second has 21 states. [2018-10-27 06:09:34,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 7 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-27 06:09:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 95 transitions. [2018-10-27 06:09:34,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 95 transitions. Stem has 14 letters. Loop has 12 letters. [2018-10-27 06:09:34,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:34,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 95 transitions. Stem has 26 letters. Loop has 12 letters. [2018-10-27 06:09:34,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:34,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 95 transitions. Stem has 14 letters. Loop has 24 letters. [2018-10-27 06:09:34,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:34,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 149 transitions. [2018-10-27 06:09:34,334 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-10-27 06:09:34,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 136 states and 143 transitions. [2018-10-27 06:09:34,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2018-10-27 06:09:34,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2018-10-27 06:09:34,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 143 transitions. [2018-10-27 06:09:34,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:34,337 INFO L705 BuchiCegarLoop]: Abstraction has 136 states and 143 transitions. [2018-10-27 06:09:34,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 143 transitions. [2018-10-27 06:09:34,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 109. [2018-10-27 06:09:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-27 06:09:34,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-10-27 06:09:34,341 INFO L728 BuchiCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-10-27 06:09:34,341 INFO L608 BuchiCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-10-27 06:09:34,341 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:09:34,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 116 transitions. [2018-10-27 06:09:34,342 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-10-27 06:09:34,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:34,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:34,348 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:34,348 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:34,349 INFO L793 eck$LassoCheckResult]: Stem: 1556#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1530#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet21; 1531#L578 assume !(main_#t~nondet21 != 0);havoc main_#t~nondet21;assume { :begin_inline_f } true;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;#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];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#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];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#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];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#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];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.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];f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset; 1544#L553-2 SUMMARY for call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L553-2 1558#L553-3 SUMMARY for call write~int(1, f_~x~0.base, f_~x~0.offset, 4); srcloc: L553-3 1559#L554-1 SUMMARY for call write~int(1, f_~y~0.base, f_~y~0.offset, 4); srcloc: L554-1 1528#L555-1 SUMMARY for call write~int(1, f_~k~0.base, f_~k~0.offset, 4); srcloc: L555-1 1529#L556-1 SUMMARY for call write~int(1, f_~z~0.base, f_~z~0.offset, 4); srcloc: L556-1 1553#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L557-1 1564#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 1566#L562-9 assume true; 1567#L562-5 SUMMARY for call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4); srcloc: L562-5 1581#L562-6 SUMMARY for call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L562-6 1586#L562-7 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 1590#L567-5 assume true; 1537#L566-9 SUMMARY for call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4); srcloc: L566-9 1582#L566-10 f_#t~short13 := f_#t~mem11 > 0; 1587#L566-11 assume f_#t~short13; 1591#L566-12 SUMMARY for call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4); srcloc: L566-12 1568#L566-13 f_#t~short13 := f_#t~mem12 > 0; 1569#L566-15 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~mem12;havoc f_#t~short13; 1532#L567-3 assume f_#t~nondet14 != 0;havoc f_#t~nondet14; 1533#L568-1 [2018-10-27 06:09:34,349 INFO L795 eck$LassoCheckResult]: Loop: 1533#L568-1 SUMMARY for call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4); srcloc: L568-1 1563#L569-3 SUMMARY for call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L569-3 1589#L569-4 SUMMARY for call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4); srcloc: L569-4 1565#L569-5 havoc f_#t~mem16;havoc f_#t~mem15; 1517#L570-2 SUMMARY for call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4); srcloc: L570-2 1518#L570-3 havoc f_#t~nondet17; 1519#L571-3 SUMMARY for call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4); srcloc: L571-3 1543#L571-4 SUMMARY for call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4); srcloc: L571-4 1550#L571-5 havoc f_#t~mem18; 1552#L567-5 assume true; 1623#L566-9 SUMMARY for call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4); srcloc: L566-9 1622#L566-10 f_#t~short13 := f_#t~mem11 > 0; 1621#L566-11 assume f_#t~short13; 1620#L566-12 SUMMARY for call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4); srcloc: L566-12 1619#L566-13 f_#t~short13 := f_#t~mem12 > 0; 1618#L566-15 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~mem12;havoc f_#t~short13; 1617#L567-3 assume f_#t~nondet14 != 0;havoc f_#t~nondet14; 1533#L568-1 [2018-10-27 06:09:34,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:34,349 INFO L82 PathProgramCache]: Analyzing trace with hash 674060345, now seen corresponding path program 1 times [2018-10-27 06:09:34,349 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:34,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:34,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:34,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:34,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:34,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:34,375 INFO L82 PathProgramCache]: Analyzing trace with hash -272416078, now seen corresponding path program 1 times [2018-10-27 06:09:34,375 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:34,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:34,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:34,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:34,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:34,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:34,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1394974342, now seen corresponding path program 1 times [2018-10-27 06:09:34,390 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:34,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:34,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:34,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:34,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:35,217 WARN L179 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-10-27 06:09:35,951 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:35,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:35,951 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4f7389e-1b80-4600-b784-b31f1726d508/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:35,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:36,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:36,067 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:36,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-10-27 06:09:36,087 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:36,095 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:36,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-10-27 06:09:36,117 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:36,118 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:36,119 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:36,121 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:36,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2018-10-27 06:09:36,147 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:36,147 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:36,148 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:36,149 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:36,150 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:36,151 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:36,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-10-27 06:09:36,152 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:36,185 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:36,193 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:36,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:36,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:36,213 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:54, output treesize:44 [2018-10-27 06:09:36,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:09:36,250 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 8 treesize of output 7 [2018-10-27 06:09:36,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:36,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:36,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:36,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 [2018-10-27 06:09:36,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:09:36,320 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 8 treesize of output 7 [2018-10-27 06:09:36,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:36,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:36,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:36,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-10-27 06:09:36,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-10-27 06:09:36,392 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 8 treesize of output 7 [2018-10-27 06:09:36,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:36,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:36,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:36,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:66, output treesize:62 [2018-10-27 06:09:36,642 INFO L303 Elim1Store]: Index analysis took 183 ms [2018-10-27 06:09:36,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2018-10-27 06:09:36,647 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 8 treesize of output 7 [2018-10-27 06:09:36,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:36,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:36,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:36,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:69 [2018-10-27 06:09:36,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-10-27 06:09:36,764 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 8 treesize of output 7 [2018-10-27 06:09:36,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:36,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:36,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:36,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-10-27 06:09:37,239 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:37,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 108 [2018-10-27 06:09:37,248 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:37,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-10-27 06:09:37,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:37,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:37,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:37,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:105, output treesize:82 [2018-10-27 06:09:37,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 88 [2018-10-27 06:09:37,393 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-10-27 06:09:37,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:37,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:37,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:37,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:93, output treesize:59 [2018-10-27 06:09:37,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 67 [2018-10-27 06:09:37,578 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-27 06:09:37,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:37,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:37,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:37,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:72, output treesize:40 [2018-10-27 06:09:38,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-10-27 06:09:38,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 06:09:38,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:38,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-27 06:09:38,044 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:38,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-10-27 06:09:38,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:38,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:38,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:38,054 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:47, output treesize:5 [2018-10-27 06:09:38,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:38,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:38,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 31 [2018-10-27 06:09:38,272 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2018-10-27 06:09:38,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-27 06:09:38,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2018-10-27 06:09:38,312 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. cyclomatic complexity: 11 Second operand 31 states. [2018-10-27 06:09:38,637 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 41 [2018-10-27 06:09:38,792 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 45 [2018-10-27 06:09:38,970 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 55 [2018-10-27 06:09:39,226 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 59 [2018-10-27 06:09:39,526 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 61 [2018-10-27 06:09:39,805 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 61 [2018-10-27 06:09:40,094 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 72 [2018-10-27 06:09:40,311 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 68 [2018-10-27 06:09:40,730 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 43 [2018-10-27 06:09:41,216 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 43 [2018-10-27 06:09:41,366 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 45 [2018-10-27 06:09:41,779 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 41 [2018-10-27 06:09:41,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:41,866 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-10-27 06:09:41,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-27 06:09:41,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 135 transitions. [2018-10-27 06:09:41,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-10-27 06:09:41,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 56 states and 59 transitions. [2018-10-27 06:09:41,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-10-27 06:09:41,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-10-27 06:09:41,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 59 transitions. [2018-10-27 06:09:41,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:41,868 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-10-27 06:09:41,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 59 transitions. [2018-10-27 06:09:41,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-10-27 06:09:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-27 06:09:41,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-10-27 06:09:41,878 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-10-27 06:09:41,879 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-10-27 06:09:41,879 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:09:41,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 59 transitions. [2018-10-27 06:09:41,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-10-27 06:09:41,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:41,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:41,880 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:41,880 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:41,880 INFO L793 eck$LassoCheckResult]: Stem: 1984#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1963#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet21; 1964#L578 assume main_#t~nondet21 != 0;havoc main_#t~nondet21;assume { :begin_inline_f } true;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;#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];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#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];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#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];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#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];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.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];f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset; 1972#L553 SUMMARY for call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L553 1981#L553-1 SUMMARY for call write~int(1, f_~x~0.base, f_~x~0.offset, 4); srcloc: L553-1 1978#L554 SUMMARY for call write~int(1, f_~y~0.base, f_~y~0.offset, 4); srcloc: L554 1959#L555 SUMMARY for call write~int(1, f_~k~0.base, f_~k~0.offset, 4); srcloc: L555 1960#L556 SUMMARY for call write~int(1, f_~z~0.base, f_~z~0.offset, 4); srcloc: L556 1953#L557 SUMMARY for call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L557 1954#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 1969#L562-4 assume true; 1970#L562 SUMMARY for call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4); srcloc: L562 1990#L562-1 SUMMARY for call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L562-1 1993#L562-2 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 1997#L567-2 assume true; 1955#L566 SUMMARY for call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4); srcloc: L566 1956#L566-1 f_#t~short13 := f_#t~mem11 > 0; 1961#L566-2 assume f_#t~short13; 1979#L566-3 SUMMARY for call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4); srcloc: L566-3 1982#L566-4 f_#t~short13 := f_#t~mem12 > 0; 1988#L566-6 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~mem12;havoc f_#t~short13; 1973#L567 assume f_#t~nondet14 != 0;havoc f_#t~nondet14; 1951#L568 [2018-10-27 06:09:41,880 INFO L795 eck$LassoCheckResult]: Loop: 1951#L568 SUMMARY for call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4); srcloc: L568 1952#L569 SUMMARY for call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L569 1966#L569-1 SUMMARY for call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4); srcloc: L569-1 1971#L569-2 havoc f_#t~mem16;havoc f_#t~mem15; 1965#L570 SUMMARY for call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4); srcloc: L570 1949#L570-1 havoc f_#t~nondet17; 1950#L571 SUMMARY for call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4); srcloc: L571 1996#L571-1 SUMMARY for call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4); srcloc: L571-1 1967#L571-2 havoc f_#t~mem18; 1968#L567-2 assume true; 2004#L566 SUMMARY for call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4); srcloc: L566 2003#L566-1 f_#t~short13 := f_#t~mem11 > 0; 2002#L566-2 assume f_#t~short13; 2001#L566-3 SUMMARY for call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4); srcloc: L566-3 2000#L566-4 f_#t~short13 := f_#t~mem12 > 0; 1999#L566-6 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~mem12;havoc f_#t~short13; 1998#L567 assume f_#t~nondet14 != 0;havoc f_#t~nondet14; 1951#L568 [2018-10-27 06:09:41,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:41,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1856624953, now seen corresponding path program 1 times [2018-10-27 06:09:41,881 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:41,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:41,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:41,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:41,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:41,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:41,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1680838246, now seen corresponding path program 1 times [2018-10-27 06:09:41,920 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:41,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:41,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:41,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:41,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:41,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:41,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1522774994, now seen corresponding path program 1 times [2018-10-27 06:09:41,934 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:41,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:41,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:41,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:41,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:42,547 WARN L179 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-10-27 06:09:43,139 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:43,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:43,139 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4f7389e-1b80-4600-b784-b31f1726d508/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:43,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:43,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:43,184 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:43,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-10-27 06:09:43,201 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:43,202 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:43,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-10-27 06:09:43,223 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:43,224 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:43,225 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:43,226 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:43,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2018-10-27 06:09:43,253 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:43,254 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:43,255 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:43,256 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:43,257 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:43,258 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:43,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-10-27 06:09:43,260 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,279 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,299 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:54, output treesize:44 [2018-10-27 06:09:43,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:09:43,332 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 8 treesize of output 7 [2018-10-27 06:09:43,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 [2018-10-27 06:09:43,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:09:43,387 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 8 treesize of output 7 [2018-10-27 06:09:43,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-10-27 06:09:43,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-10-27 06:09:43,463 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 8 treesize of output 7 [2018-10-27 06:09:43,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:66, output treesize:62 [2018-10-27 06:09:43,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2018-10-27 06:09:43,537 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 8 treesize of output 7 [2018-10-27 06:09:43,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:43,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:69 [2018-10-27 06:09:43,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-10-27 06:09:43,665 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 8 treesize of output 7 [2018-10-27 06:09:43,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:43,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-10-27 06:09:43,910 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:43,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 108 [2018-10-27 06:09:43,920 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:43,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-10-27 06:09:43,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:43,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:105, output treesize:82 [2018-10-27 06:09:44,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 88 [2018-10-27 06:09:44,059 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-10-27 06:09:44,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:44,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:44,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:44,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:93, output treesize:59 [2018-10-27 06:09:44,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 67 [2018-10-27 06:09:44,148 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-27 06:09:44,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:44,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:44,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:44,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:72, output treesize:40 [2018-10-27 06:09:44,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-10-27 06:09:44,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 06:09:44,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:44,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-10-27 06:09:44,234 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:44,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-27 06:09:44,239 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:44,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:44,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:44,245 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:47, output treesize:3 [2018-10-27 06:09:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:44,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:44,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 30 [2018-10-27 06:09:44,704 WARN L179 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2018-10-27 06:09:44,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-27 06:09:44,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2018-10-27 06:09:44,749 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. cyclomatic complexity: 5 Second operand 30 states. [2018-10-27 06:10:12,075 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 41 [2018-10-27 06:10:12,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:12,175 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-27 06:10:12,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-27 06:10:12,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 78 transitions. [2018-10-27 06:10:12,176 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:12,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 0 states and 0 transitions. [2018-10-27 06:10:12,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:10:12,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:10:12,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:10:12,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:12,177 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:12,177 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:12,177 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:12,177 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:10:12,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:10:12,177 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:12,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:10:12,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:10:12 BoogieIcfgContainer [2018-10-27 06:10:12,183 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:10:12,183 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:10:12,183 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:10:12,183 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:10:12,184 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:19" (3/4) ... [2018-10-27 06:10:12,187 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:10:12,187 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:10:12,188 INFO L168 Benchmark]: Toolchain (without parser) took 53836.52 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 495.5 MB). Free memory was 951.8 MB in the beginning and 1.5 GB in the end (delta: -519.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:12,189 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:12,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.37 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 930.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:12,189 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.4 MB). Free memory was 930.3 MB in the beginning and 1.2 GB in the end (delta: -256.7 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:12,189 INFO L168 Benchmark]: Boogie Preprocessor took 37.43 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.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:12,189 INFO L168 Benchmark]: RCFGBuilder took 914.94 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: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:12,190 INFO L168 Benchmark]: BuchiAutomizer took 52415.08 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 303.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -327.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:12,190 INFO L168 Benchmark]: Witness Printer took 4.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:12,191 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 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 351.37 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 930.3 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 109.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.4 MB). Free memory was 930.3 MB in the beginning and 1.2 GB in the end (delta: -256.7 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.43 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.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 914.94 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: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 52415.08 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 303.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -327.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 14 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 14 locations. 4 modules have a trivial ranking function, the largest among these consists of 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 52.3s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 15.5s. Construction of modules took 27.1s. Büchi inclusion checks took 9.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 59 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 109 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 259 SDtfs, 1542 SDslu, 1178 SDs, 0 SdLazy, 1535 SolverSat, 378 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 27.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital538 mio100 ax103 hnf100 lsp93 ukn60 mio100 lsp33 div100 bol100 ite100 ukn100 eq203 hnf87 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 3 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...