./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4acd8883-1feb-45df-8cc1-f46bfebd4540/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4acd8883-1feb-45df-8cc1-f46bfebd4540/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4acd8883-1feb-45df-8cc1-f46bfebd4540/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4acd8883-1feb-45df-8cc1-f46bfebd4540/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4acd8883-1feb-45df-8cc1-f46bfebd4540/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4acd8883-1feb-45df-8cc1-f46bfebd4540/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 25885afdfdd91cf9312b78ad87a032f4ef31fe0c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 02:12:17,106 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:12:17,108 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:12:17,116 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:12:17,116 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:12:17,117 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:12:17,117 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:12:17,119 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:12:17,120 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:12:17,120 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:12:17,121 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:12:17,121 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:12:17,122 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:12:17,122 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:12:17,123 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:12:17,124 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:12:17,124 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:12:17,126 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:12:17,127 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:12:17,128 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:12:17,129 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:12:17,130 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:12:17,131 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:12:17,132 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:12:17,132 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:12:17,132 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:12:17,133 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:12:17,134 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:12:17,134 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:12:17,135 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:12:17,135 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:12:17,135 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:12:17,135 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:12:17,135 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:12:17,136 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:12:17,136 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:12:17,136 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4acd8883-1feb-45df-8cc1-f46bfebd4540/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 02:12:17,144 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:12:17,144 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:12:17,145 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 02:12:17,145 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 02:12:17,145 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 02:12:17,145 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 02:12:17,146 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 02:12:17,146 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 02:12:17,146 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 02:12:17,146 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 02:12:17,146 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 02:12:17,146 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:12:17,146 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 02:12:17,146 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:12:17,147 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:12:17,147 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 02:12:17,147 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 02:12:17,147 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 02:12:17,147 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 02:12:17,147 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 02:12:17,147 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 02:12:17,147 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 02:12:17,148 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:12:17,148 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:12:17,148 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 02:12:17,148 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:12:17,148 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 02:12:17,148 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 02:12:17,149 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 02:12:17,149 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_4acd8883-1feb-45df-8cc1-f46bfebd4540/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 -> 25885afdfdd91cf9312b78ad87a032f4ef31fe0c [2018-12-02 02:12:17,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:12:17,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:12:17,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:12:17,179 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:12:17,179 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:12:17,180 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4acd8883-1feb-45df-8cc1-f46bfebd4540/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-12-02 02:12:17,225 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4acd8883-1feb-45df-8cc1-f46bfebd4540/bin-2019/uautomizer/data/2b3d95065/39b4b03ba17a4ab785788ec28dec690e/FLAG037da186f [2018-12-02 02:12:17,636 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:12:17,636 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4acd8883-1feb-45df-8cc1-f46bfebd4540/sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-12-02 02:12:17,642 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4acd8883-1feb-45df-8cc1-f46bfebd4540/bin-2019/uautomizer/data/2b3d95065/39b4b03ba17a4ab785788ec28dec690e/FLAG037da186f [2018-12-02 02:12:17,650 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4acd8883-1feb-45df-8cc1-f46bfebd4540/bin-2019/uautomizer/data/2b3d95065/39b4b03ba17a4ab785788ec28dec690e [2018-12-02 02:12:17,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:12:17,653 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:12:17,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:12:17,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:12:17,656 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:12:17,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:12:17" (1/1) ... [2018-12-02 02:12:17,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b6f768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:17, skipping insertion in model container [2018-12-02 02:12:17,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:12:17" (1/1) ... [2018-12-02 02:12:17,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:12:17,686 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:12:17,844 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:12:17,852 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:12:17,908 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:12:17,936 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:12:17,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:17 WrapperNode [2018-12-02 02:12:17,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:12:17,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:12:17,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:12:17,937 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:12:17,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:17" (1/1) ... [2018-12-02 02:12:17,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:17" (1/1) ... [2018-12-02 02:12:17,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:12:17,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:12:17,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:12:17,961 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:12:17,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:17" (1/1) ... [2018-12-02 02:12:17,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:17" (1/1) ... [2018-12-02 02:12:17,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:17" (1/1) ... [2018-12-02 02:12:17,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:17" (1/1) ... [2018-12-02 02:12:17,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:17" (1/1) ... [2018-12-02 02:12:17,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:17" (1/1) ... [2018-12-02 02:12:17,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:17" (1/1) ... [2018-12-02 02:12:17,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:12:17,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:12:17,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:12:17,975 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:12:17,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4acd8883-1feb-45df-8cc1-f46bfebd4540/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-12-02 02:12:18,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 02:12:18,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 02:12:18,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 02:12:18,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 02:12:18,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:12:18,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:12:18,143 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:12:18,143 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-02 02:12:18,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:12:18 BoogieIcfgContainer [2018-12-02 02:12:18,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:12:18,144 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 02:12:18,144 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 02:12:18,146 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 02:12:18,146 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 02:12:18,147 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 02:12:17" (1/3) ... [2018-12-02 02:12:18,147 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ee21b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:12:18, skipping insertion in model container [2018-12-02 02:12:18,147 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 02:12:18,147 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:17" (2/3) ... [2018-12-02 02:12:18,147 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ee21b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:12:18, skipping insertion in model container [2018-12-02 02:12:18,148 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 02:12:18,148 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:12:18" (3/3) ... [2018-12-02 02:12:18,149 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-12-02 02:12:18,179 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 02:12:18,179 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 02:12:18,179 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 02:12:18,179 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 02:12:18,179 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:12:18,179 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:12:18,180 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 02:12:18,180 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:12:18,180 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 02:12:18,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-02 02:12:18,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 02:12:18,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:12:18,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:12:18,203 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 02:12:18,203 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 02:12:18,203 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 02:12:18,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-02 02:12:18,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 02:12:18,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:12:18,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:12:18,205 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 02:12:18,205 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 02:12:18,209 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 6#L555true assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 10#L555-2true assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 7#L558-3true [2018-12-02 02:12:18,210 INFO L796 eck$LassoCheckResult]: Loop: 7#L558-3true call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 4#L558-1true assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 16#L559true assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 5#L559-2true call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 7#L558-3true [2018-12-02 02:12:18,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:18,213 INFO L82 PathProgramCache]: Analyzing trace with hash 925673, now seen corresponding path program 1 times [2018-12-02 02:12:18,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:12:18,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:12:18,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:18,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:18,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:18,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:18,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1482703, now seen corresponding path program 1 times [2018-12-02 02:12:18,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:12:18,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:12:18,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:18,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:18,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:18,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:18,317 INFO L82 PathProgramCache]: Analyzing trace with hash 180521911, now seen corresponding path program 1 times [2018-12-02 02:12:18,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:12:18,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:12:18,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:18,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:18,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:18,700 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 97 [2018-12-02 02:12:18,787 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 02:12:18,788 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 02:12:18,788 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 02:12:18,788 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 02:12:18,788 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 02:12:18,788 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:12:18,788 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 02:12:18,788 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 02:12:18,788 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-12-02 02:12:18,789 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 02:12:18,789 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 02:12:18,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-12-02 02:12:18,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-12-02 02:12:18,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:18,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:18,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:18,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:18,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:18,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:18,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:18,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:18,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:18,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:18,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:18,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:18,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:18,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:19,022 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2018-12-02 02:12:19,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:19,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:19,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:19,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:19,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:19,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:19,409 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 02:12:19,412 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 02:12:19,413 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-12-02 02:12:19,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:19,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:19,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:19,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:19,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:19,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:19,418 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-12-02 02:12:19,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:19,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:19,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:19,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:19,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:19,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:19,420 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-12-02 02:12:19,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:19,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:19,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:19,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:19,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:19,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:19,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-12-02 02:12:19,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:19,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:19,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:19,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:19,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:19,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:19,424 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-12-02 02:12:19,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:19,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:19,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:19,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:19,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:19,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:19,426 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-12-02 02:12:19,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:19,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:19,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:19,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:19,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:19,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-12-02 02:12:19,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:19,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:19,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:19,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:19,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:19,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:19,433 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-12-02 02:12:19,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:19,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:19,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:19,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:19,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:19,437 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-12-02 02:12:19,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:19,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:19,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:19,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:19,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:19,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:12:19,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:19,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:19,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:19,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:19,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:19,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:19,443 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-12-02 02:12:19,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:19,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:19,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:19,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:19,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:19,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:19,445 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-12-02 02:12:19,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:19,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:19,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:19,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:19,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:19,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:12:19,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:19,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:19,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:19,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:19,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:19,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:19,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:12:19,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:19,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:19,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:19,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:19,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:19,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:19,453 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-12-02 02:12:19,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:19,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:19,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:19,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:19,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:19,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:19,455 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-12-02 02:12:19,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,456 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 02:12:19,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:19,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,457 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:12:19,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:19,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:19,463 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-12-02 02:12:19,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:19,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:19,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:19,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:19,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:19,472 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-12-02 02:12:19,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,473 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 02:12:19,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:19,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,474 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:12:19,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:19,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:19,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-12-02 02:12:19,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:19,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:19,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:19,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:19,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:19,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:12:19,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:19,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:19,484 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:12:19,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:19,488 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-02 02:12:19,488 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 02:12:19,536 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 02:12:19,565 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 02:12:19,565 INFO L444 ModelExtractionUtils]: 34 out of 46 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-12-02 02:12:19,567 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 02:12:19,568 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-02 02:12:19,568 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 02:12:19,569 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-12-02 02:12:19,635 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-02 02:12:19,642 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 02:12:19,643 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 02:12:19,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:19,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:12:19,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2018-12-02 02:12:19,702 INFO L478 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-12-02 02:12:19,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:19,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2018-12-02 02:12:19,750 INFO L478 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 31 treesize of output 30 [2018-12-02 02:12:19,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:19,778 INFO L478 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 2 case distinctions, treesize of input 28 treesize of output 33 [2018-12-02 02:12:19,779 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-02 02:12:19,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-12-02 02:12:19,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-02 02:12:19,812 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:19,816 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:19,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-12-02 02:12:19,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2018-12-02 02:12:19,824 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-02 02:12:19,833 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:12:19,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-12-02 02:12:19,865 INFO L478 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 24 treesize of output 17 [2018-12-02 02:12:19,865 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:19,875 INFO L478 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 17 treesize of output 12 [2018-12-02 02:12:19,875 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:19,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 02:12:19,887 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-02 02:12:19,896 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 02:12:19,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 02:12:19,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 02:12:19,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:12:19,951 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:71, output treesize:10 [2018-12-02 02:12:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:19,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:12:19,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:19,990 INFO L478 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2018-12-02 02:12:19,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-12-02 02:12:19,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:20,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:20,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:20,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 32 treesize of output 45 [2018-12-02 02:12:20,029 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:20,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:12:20,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:12:20,048 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:46, output treesize:50 [2018-12-02 02:12:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:12:20,075 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-12-02 02:12:20,076 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 7 states. [2018-12-02 02:12:20,134 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 7 states. Result 37 states and 45 transitions. Complement of second has 8 states. [2018-12-02 02:12:20,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 02:12:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 02:12:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-12-02 02:12:20,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 4 letters. Loop has 4 letters. [2018-12-02 02:12:20,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:12:20,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-02 02:12:20,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:12:20,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 4 letters. Loop has 8 letters. [2018-12-02 02:12:20,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:12:20,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 45 transitions. [2018-12-02 02:12:20,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 02:12:20,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 18 states and 22 transitions. [2018-12-02 02:12:20,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 02:12:20,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-02 02:12:20,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2018-12-02 02:12:20,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 02:12:20,144 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-12-02 02:12:20,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2018-12-02 02:12:20,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-12-02 02:12:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-02 02:12:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-12-02 02:12:20,161 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-02 02:12:20,161 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-02 02:12:20,161 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 02:12:20,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-12-02 02:12:20,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 02:12:20,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:12:20,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:12:20,162 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 02:12:20,162 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 02:12:20,162 INFO L794 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 207#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 208#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 209#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 210#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 216#L558-1 [2018-12-02 02:12:20,162 INFO L796 eck$LassoCheckResult]: Loop: 216#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 217#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 220#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 212#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 213#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 216#L558-1 [2018-12-02 02:12:20,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:20,162 INFO L82 PathProgramCache]: Analyzing trace with hash 28695881, now seen corresponding path program 1 times [2018-12-02 02:12:20,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:12:20,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:12:20,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:20,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:20,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:20,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:20,175 INFO L82 PathProgramCache]: Analyzing trace with hash 50737098, now seen corresponding path program 1 times [2018-12-02 02:12:20,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:12:20,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:12:20,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:20,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:20,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:20,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:20,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1682923394, now seen corresponding path program 1 times [2018-12-02 02:12:20,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:12:20,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:12:20,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:20,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:20,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:20,469 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 99 [2018-12-02 02:12:20,538 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 02:12:20,538 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 02:12:20,538 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 02:12:20,538 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 02:12:20,538 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 02:12:20,538 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:12:20,538 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 02:12:20,538 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 02:12:20,538 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-12-02 02:12:20,538 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 02:12:20,539 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 02:12:20,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:20,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:20,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:20,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:20,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:20,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:20,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-12-02 02:12:20,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-12-02 02:12:20,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:20,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:20,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:20,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:20,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:20,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:20,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:20,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:20,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:20,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:20,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:20,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:20,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:21,072 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 02:12:21,072 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 02:12:21,072 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-12-02 02:12:21,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:21,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:21,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:21,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:21,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:21,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:21,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:21,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:21,075 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-12-02 02:12:21,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:21,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:21,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:21,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:21,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:21,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:21,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:21,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:21,077 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-12-02 02:12:21,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:21,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:21,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:21,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:21,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:21,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:21,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:21,080 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-12-02 02:12:21,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:21,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:21,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:21,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:21,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:21,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:21,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:21,083 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-12-02 02:12:21,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:21,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:21,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:21,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:21,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:21,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:21,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:21,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:21,084 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-12-02 02:12:21,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:21,085 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 02:12:21,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:21,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:21,086 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:12:21,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:21,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:21,089 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-12-02 02:12:21,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:21,090 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 02:12:21,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:21,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:21,091 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:12:21,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:21,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:21,094 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-12-02 02:12:21,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:21,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:21,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:21,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:21,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:21,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:21,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:21,098 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-12-02 02:12:21,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:21,099 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 02:12:21,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:21,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:21,100 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:12:21,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:21,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:21,103 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-12-02 02:12:21,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:21,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:21,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:21,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:21,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:21,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:21,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:21,106 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-12-02 02:12:21,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:21,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:21,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:21,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:21,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:21,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:21,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:21,111 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-12-02 02:12:21,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:21,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:21,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:21,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:21,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:21,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:21,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:21,115 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-12-02 02:12:21,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:21,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:21,116 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:12:21,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:21,120 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-02 02:12:21,120 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 02:12:21,147 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 02:12:21,162 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 02:12:21,162 INFO L444 ModelExtractionUtils]: 43 out of 51 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-02 02:12:21,162 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 02:12:21,163 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-02 02:12:21,163 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 02:12:21,163 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-12-02 02:12:21,230 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-02 02:12:21,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 02:12:21,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:21,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:12:21,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:21,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2018-12-02 02:12:21,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:21,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-12-02 02:12:21,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:21,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2018-12-02 02:12:21,282 INFO L478 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-12-02 02:12:21,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:21,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2018-12-02 02:12:21,332 INFO L478 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 2 case distinctions, treesize of input 28 treesize of output 33 [2018-12-02 02:12:21,333 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-02 02:12:21,364 INFO L478 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 31 treesize of output 30 [2018-12-02 02:12:21,364 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:21,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-12-02 02:12:21,396 INFO L478 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 11 treesize of output 3 [2018-12-02 02:12:21,396 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:21,402 INFO L478 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-12-02 02:12:21,402 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:21,405 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:21,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-12-02 02:12:21,437 INFO L478 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 19 treesize of output 12 [2018-12-02 02:12:21,438 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:21,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 02:12:21,450 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-02 02:12:21,459 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 02:12:21,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-12-02 02:12:21,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-02 02:12:21,480 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:21,483 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:21,495 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 02:12:21,507 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 02:12:21,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:12:21,522 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:91, output treesize:10 [2018-12-02 02:12:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:21,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:12:21,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:21,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 33 [2018-12-02 02:12:21,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:21,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-02 02:12:21,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:21,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:21,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:21,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-12-02 02:12:21,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:21,579 INFO L478 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 34 treesize of output 43 [2018-12-02 02:12:21,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:21,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-02 02:12:21,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:21,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:21,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:21,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:21 [2018-12-02 02:12:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:12:21,592 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-12-02 02:12:21,592 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-12-02 02:12:21,625 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 37 states and 44 transitions. Complement of second has 8 states. [2018-12-02 02:12:21,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 02:12:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 02:12:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-12-02 02:12:21,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 5 letters. [2018-12-02 02:12:21,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:12:21,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 10 letters. Loop has 5 letters. [2018-12-02 02:12:21,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:12:21,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-02 02:12:21,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:12:21,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-12-02 02:12:21,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 02:12:21,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 25 states and 30 transitions. [2018-12-02 02:12:21,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 02:12:21,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 02:12:21,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2018-12-02 02:12:21,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 02:12:21,629 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-12-02 02:12:21,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2018-12-02 02:12:21,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-02 02:12:21,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 02:12:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2018-12-02 02:12:21,631 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-12-02 02:12:21,631 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-12-02 02:12:21,631 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 02:12:21,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2018-12-02 02:12:21,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 02:12:21,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:12:21,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:12:21,632 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:12:21,632 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 02:12:21,632 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 420#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 421#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 422#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 434#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 438#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 437#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 425#L558-3 [2018-12-02 02:12:21,632 INFO L796 eck$LassoCheckResult]: Loop: 425#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 428#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 429#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 432#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 424#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 425#L558-3 [2018-12-02 02:12:21,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:21,633 INFO L82 PathProgramCache]: Analyzing trace with hash 180521911, now seen corresponding path program 2 times [2018-12-02 02:12:21,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:12:21,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:12:21,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:21,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:21,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:21,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:21,651 INFO L82 PathProgramCache]: Analyzing trace with hash 45965688, now seen corresponding path program 2 times [2018-12-02 02:12:21,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:12:21,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:12:21,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:21,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:12:21,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:21,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:21,659 INFO L82 PathProgramCache]: Analyzing trace with hash -915687550, now seen corresponding path program 1 times [2018-12-02 02:12:21,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:12:21,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:12:21,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:21,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:12:21,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:22,242 WARN L180 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 116 [2018-12-02 02:12:22,402 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-12-02 02:12:22,404 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 02:12:22,404 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 02:12:22,404 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 02:12:22,404 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 02:12:22,404 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 02:12:22,405 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:12:22,405 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 02:12:22,405 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 02:12:22,405 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-12-02 02:12:22,405 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 02:12:22,405 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 02:12:22,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,615 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2018-12-02 02:12:22,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,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-12-02 02:12:22,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-12-02 02:12:22,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:12:22,960 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 02:12:22,960 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 02:12:22,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:12:22,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:22,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:22,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:22,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:22,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:22,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:22,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:22,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:22,962 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-12-02 02:12:22,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:22,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:22,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:22,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:22,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:22,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:22,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:22,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:22,963 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-12-02 02:12:22,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:22,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:22,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:22,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:22,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:22,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:22,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:22,965 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-12-02 02:12:22,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:22,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:22,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:22,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:22,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:22,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:22,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:22,966 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-12-02 02:12:22,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:22,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:22,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:22,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:22,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:22,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:22,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:22,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:22,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:12:22,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:22,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:22,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:22,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:22,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:22,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:22,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:22,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:22,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:12:22,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:22,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:22,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:22,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:22,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:22,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:22,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:22,970 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-12-02 02:12:22,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:22,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:22,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:22,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:22,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:22,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:22,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:22,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:22,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:12:22,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:22,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:22,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:22,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:22,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:22,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:22,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:22,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:22,974 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-12-02 02:12:22,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:22,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:22,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:22,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:22,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:22,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:22,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:22,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:22,975 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-12-02 02:12:22,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:22,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:22,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:22,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:22,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:22,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:22,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:22,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:22,977 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-12-02 02:12:22,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:22,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:12:22,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:22,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:22,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:22,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:12:22,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:12:22,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:22,978 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-12-02 02:12:22,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:22,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:22,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:22,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:22,979 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:22,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:22,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:22,981 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-12-02 02:12:22,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:22,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:22,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:22,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:22,982 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:22,982 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:22,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:22,985 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-12-02 02:12:22,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:22,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:22,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:22,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:22,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:22,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:22,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:22,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:12:22,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:22,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:22,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:22,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:22,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:22,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:22,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:22,994 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-12-02 02:12:22,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:22,994 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 02:12:22,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:22,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:22,995 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:12:22,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:22,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:22,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:12:22,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:22,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:22,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:22,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:22,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:22,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:23,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:23,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:12:23,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:23,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:23,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:23,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:23,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:23,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:23,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:12:23,004 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-12-02 02:12:23,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:12:23,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:12:23,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:12:23,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:12:23,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:12:23,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:12:23,015 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 02:12:23,022 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 02:12:23,022 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 02:12:23,022 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 02:12:23,023 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 02:12:23,023 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 02:12:23,023 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2018-12-02 02:12:23,069 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-02 02:12:23,070 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 02:12:23,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:23,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:12:23,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-02 02:12:23,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:23,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2018-12-02 02:12:23,114 INFO L478 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-12-02 02:12:23,114 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:23,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 42 [2018-12-02 02:12:23,138 INFO L478 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 31 treesize of output 30 [2018-12-02 02:12:23,138 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:23,171 INFO L478 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 2 case distinctions, treesize of input 28 treesize of output 33 [2018-12-02 02:12:23,172 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-02 02:12:23,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 29 treesize of output 54 [2018-12-02 02:12:23,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 36 [2018-12-02 02:12:23,237 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-12-02 02:12:23,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 36 [2018-12-02 02:12:23,311 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-02 02:12:23,362 INFO L478 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 26 treesize of output 25 [2018-12-02 02:12:23,362 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:23,398 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-02 02:12:23,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-12-02 02:12:23,467 INFO L478 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 26 treesize of output 25 [2018-12-02 02:12:23,467 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:23,484 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:12:23,485 INFO L478 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 23 treesize of output 20 [2018-12-02 02:12:23,485 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:23,496 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:12:23,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 53 [2018-12-02 02:12:23,566 INFO L478 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 28 treesize of output 25 [2018-12-02 02:12:23,566 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:23,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 36 [2018-12-02 02:12:23,622 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 3 xjuncts. [2018-12-02 02:12:23,681 INFO L478 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 23 treesize of output 22 [2018-12-02 02:12:23,682 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:23,725 INFO L478 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 2 case distinctions, treesize of input 28 treesize of output 33 [2018-12-02 02:12:23,726 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-12-02 02:12:23,754 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-02 02:12:23,792 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-02 02:12:23,817 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-02 02:12:23,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-02 02:12:23,843 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 4 variables, input treesize:74, output treesize:85 [2018-12-02 02:12:23,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2018-12-02 02:12:23,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:23,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:23,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 22 [2018-12-02 02:12:23,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:23,970 INFO L478 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 29 treesize of output 22 [2018-12-02 02:12:23,970 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2018-12-02 02:12:24,029 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 02:12:24,119 INFO L478 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 18 treesize of output 14 [2018-12-02 02:12:24,120 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:24,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:24,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 18 [2018-12-02 02:12:24,158 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,187 INFO L478 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 28 treesize of output 24 [2018-12-02 02:12:24,187 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,239 INFO L478 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 25 treesize of output 23 [2018-12-02 02:12:24,240 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:24,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:24,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 20 treesize of output 19 [2018-12-02 02:12:24,268 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,288 INFO L478 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 21 treesize of output 19 [2018-12-02 02:12:24,289 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 11 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-02 02:12:24,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 02:12:24,324 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:30, output treesize:30 [2018-12-02 02:12:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:24,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:12:24,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:24,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 33 [2018-12-02 02:12:24,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:24,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-02 02:12:24,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-12-02 02:12:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:12:24,392 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2018-12-02 02:12:24,392 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 8 Second operand 10 states. [2018-12-02 02:12:24,513 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 8. Second operand 10 states. Result 60 states and 72 transitions. Complement of second has 11 states. [2018-12-02 02:12:24,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 02:12:24,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-02 02:12:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2018-12-02 02:12:24,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 5 letters. [2018-12-02 02:12:24,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:12:24,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 13 letters. Loop has 5 letters. [2018-12-02 02:12:24,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:12:24,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 10 letters. [2018-12-02 02:12:24,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:12:24,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 72 transitions. [2018-12-02 02:12:24,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 02:12:24,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 41 states and 49 transitions. [2018-12-02 02:12:24,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 02:12:24,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 02:12:24,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 49 transitions. [2018-12-02 02:12:24,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 02:12:24,517 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-12-02 02:12:24,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 49 transitions. [2018-12-02 02:12:24,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-12-02 02:12:24,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 02:12:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-12-02 02:12:24,518 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-12-02 02:12:24,518 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-12-02 02:12:24,518 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 02:12:24,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2018-12-02 02:12:24,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 02:12:24,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:12:24,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:12:24,519 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1] [2018-12-02 02:12:24,519 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 02:12:24,519 INFO L794 eck$LassoCheckResult]: Stem: 689#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 685#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 686#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 687#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 688#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 700#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 709#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 708#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 707#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 705#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 704#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 703#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 695#L558-3 [2018-12-02 02:12:24,519 INFO L796 eck$LassoCheckResult]: Loop: 695#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 690#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 691#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 698#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 694#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 695#L558-3 [2018-12-02 02:12:24,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:24,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1969201019, now seen corresponding path program 3 times [2018-12-02 02:12:24,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:12:24,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:12:24,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:24,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:24,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:12:24,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:24,638 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4acd8883-1feb-45df-8cc1-f46bfebd4540/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-12-02 02:12:24,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 02:12:24,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-02 02:12:24,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:12:24,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:12:24,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:24,679 INFO L478 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 17 treesize of output 29 [2018-12-02 02:12:24,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:24,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:24,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 02:12:24,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2018-12-02 02:12:24,722 INFO L478 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-12-02 02:12:24,723 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,737 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 42 [2018-12-02 02:12:24,740 INFO L478 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 31 treesize of output 30 [2018-12-02 02:12:24,740 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,765 INFO L478 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 28 treesize of output 25 [2018-12-02 02:12:24,765 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 45 [2018-12-02 02:12:24,800 INFO L478 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 34 treesize of output 33 [2018-12-02 02:12:24,801 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,812 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:12:24,837 INFO L478 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 22 treesize of output 23 [2018-12-02 02:12:24,839 INFO L478 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-12-02 02:12:24,839 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,843 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 42 [2018-12-02 02:12:24,875 INFO L478 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 31 treesize of output 30 [2018-12-02 02:12:24,875 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,896 INFO L478 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 24 treesize of output 21 [2018-12-02 02:12:24,897 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:24,905 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:12:24,918 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 02:12:24,929 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 02:12:24,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 02:12:24,944 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:88, output treesize:70 [2018-12-02 02:12:25,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 39 [2018-12-02 02:12:25,006 INFO L478 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 28 treesize of output 27 [2018-12-02 02:12:25,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:25,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:25,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:25,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-12-02 02:12:25,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:25,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 58 [2018-12-02 02:12:25,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:25,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2018-12-02 02:12:25,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:25,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:25,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-12-02 02:12:25,069 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:25,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:12:25,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 02:12:25,091 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:46, output treesize:69 [2018-12-02 02:12:25,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2018-12-02 02:12:25,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-02 02:12:25,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:25,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-02 02:12:25,194 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 02:12:25,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-12-02 02:12:25,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 02:12:25,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:12:25,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:12:25,228 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:17 [2018-12-02 02:12:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:12:25,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:12:25,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-12-02 02:12:25,258 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 02:12:25,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:25,258 INFO L82 PathProgramCache]: Analyzing trace with hash 45965688, now seen corresponding path program 3 times [2018-12-02 02:12:25,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:12:25,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:12:25,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:25,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:12:25,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:25,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 02:12:25,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:12:25,343 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-12-02 02:12:25,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:12:25,654 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-12-02 02:12:25,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 02:12:25,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2018-12-02 02:12:25,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 02:12:25,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 23 states and 26 transitions. [2018-12-02 02:12:25,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 02:12:25,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-02 02:12:25,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2018-12-02 02:12:25,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 02:12:25,655 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-02 02:12:25,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2018-12-02 02:12:25,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-12-02 02:12:25,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 02:12:25,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-12-02 02:12:25,657 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-02 02:12:25,657 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-02 02:12:25,657 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 02:12:25,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2018-12-02 02:12:25,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 02:12:25,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:12:25,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:12:25,657 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:12:25,657 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 02:12:25,658 INFO L794 eck$LassoCheckResult]: Stem: 822#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 818#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 819#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 820#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 821#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 825#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 826#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 833#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 829#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 830#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 823#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 824#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 827#L559-2 [2018-12-02 02:12:25,658 INFO L796 eck$LassoCheckResult]: Loop: 827#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 828#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 835#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 834#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 832#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 827#L559-2 [2018-12-02 02:12:25,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:25,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1913288219, now seen corresponding path program 2 times [2018-12-02 02:12:25,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:12:25,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:12:25,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:25,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:12:25,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:12:25,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:25,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4acd8883-1feb-45df-8cc1-f46bfebd4540/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-12-02 02:12:25,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 02:12:25,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 02:12:25,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:12:25,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:12:25,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:25,801 INFO L478 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 17 treesize of output 29 [2018-12-02 02:12:25,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:25,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:25,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 02:12:25,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:25,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:25,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:25,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-12-02 02:12:25,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:25,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-12-02 02:12:25,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:25,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-12-02 02:12:25,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:25,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:25,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:25,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-12-02 02:12:25,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:25,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 48 [2018-12-02 02:12:25,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:12:25,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-02 02:12:25,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:25,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:25,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:25,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:18 [2018-12-02 02:12:25,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-12-02 02:12:25,904 INFO L478 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-12-02 02:12:25,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:25,908 INFO L478 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-12-02 02:12:25,908 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:12:25,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:25,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:12:25,915 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2018-12-02 02:12:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:12:25,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:12:25,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-12-02 02:12:25,930 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 02:12:25,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:25,930 INFO L82 PathProgramCache]: Analyzing trace with hash 61511628, now seen corresponding path program 4 times [2018-12-02 02:12:25,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:12:25,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:12:25,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:25,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:12:25,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:12:26,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 02:12:26,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-02 02:12:26,013 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 12 states. [2018-12-02 02:12:26,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:12:26,074 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-12-02 02:12:26,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:12:26,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2018-12-02 02:12:26,075 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 02:12:26,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2018-12-02 02:12:26,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 02:12:26,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 02:12:26,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 02:12:26,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:12:26,075 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:12:26,075 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:12:26,075 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:12:26,075 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 02:12:26,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 02:12:26,075 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 02:12:26,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 02:12:26,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 02:12:26 BoogieIcfgContainer [2018-12-02 02:12:26,079 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 02:12:26,079 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:12:26,079 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:12:26,079 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:12:26,080 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:12:18" (3/4) ... [2018-12-02 02:12:26,082 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 02:12:26,082 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:12:26,082 INFO L168 Benchmark]: Toolchain (without parser) took 8429.69 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 272.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 85.8 MB. Max. memory is 11.5 GB. [2018-12-02 02:12:26,083 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:12:26,083 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -139.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-02 02:12:26,083 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 02:12:26,083 INFO L168 Benchmark]: Boogie Preprocessor took 13.78 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:12:26,083 INFO L168 Benchmark]: RCFGBuilder took 168.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-02 02:12:26,083 INFO L168 Benchmark]: BuchiAutomizer took 7935.19 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -70.2 MB). Peak memory consumption was 102.3 MB. Max. memory is 11.5 GB. [2018-12-02 02:12:26,083 INFO L168 Benchmark]: Witness Printer took 2.55 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:12:26,085 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 282.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -139.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.78 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 168.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7935.19 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -70.2 MB). Peak memory consumption was 102.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.55 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.1s. Construction of modules took 0.1s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 111 SDslu, 43 SDs, 0 SdLazy, 179 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital551 mio100 ax104 hnf100 lsp93 ukn46 mio100 lsp38 div100 bol100 ite100 ukn100 eq182 hnf88 smp96 dnf101 smp100 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 85ms VariablesStem: 8 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...